A graph-based estimator of the number of clusters

@inproceedings{Biau2007AGE,
  title={A graph-based estimator of the number of clusters},
  author={G{\'e}rard Biau and Beno{\^i}t Cadre and Bruno Pelletier},
  year={2007}
}
Assessing the number of clusters of a statistical population is one of the essential issues of unsupervised learning. Given n independent observations X 1 ,...,X n drawn from an unknown multivariate probability density f , we propose a new approach to estimate the number of connected components, or clusters, of the t -level set $\mathcal L(t)=\{x:f(x) \geq t\}$ . The basic idea is to form a rough skeleton of the set $\mathcal L(t)$ using any preliminary estimator of f , and to count the… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

Optimal construction of k-nearest-neighbor graphs for identifying noisy clusters

VIEW 4 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions

  • IEEE Transactions on Information Theory
  • 2009
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED