A graph-based estimator of the number of clusters

Author： Biau Gérard   Cadre Benoît   Pelletier Bruno  

Publisher： Edp Sciences

E-ISSN： 1262-3318|11|issue|272-280

ISSN： 1292-8100

Source： ESAIM: Probability and Statistics, Vol.11, Iss.issue, 2007-06, pp. : 272-280

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Geodetic Number of an Oriented Graph

By Chartrand G.   Zhang P.  

European Journal of Combinatorics, Vol. 21, Iss. 2, 2000-02 ,pp. : 181-189

Elsevier

Access to resources Recommend Favorite

A Graph-based Equilibrium Problem for the Limiting Distribution of Nonintersecting Brownian Motions at Low Temperature

By Delvaux Steven  

Constructive Approximation, Vol. 32, Iss. 3, 2010-12 ,pp. : 467-512

Springer Publishing Company

Access to resources Recommend Favorite

Research problem: The completion number of a graph

By Bakonyi M.  

Linear and Multilinear Algebra, Vol. 53, Iss. 3, 2005-06 ,pp. : 189-192

Taylor & Francis Ltd

Access to resources Recommend Favorite

Spectra of graph operations based on R-graph

By Lan Jie   Zhou Bo  

Linear and Multilinear Algebra, Vol. 63, Iss. 7, 2015-07 ,pp. : 1401-1422

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the number of edges not covered by monochromatic copies of a fixed graph

By Keevash P.   Sudakov B.  

Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. : 41-53

Elsevier

Access to resources Recommend Favorite