REVIEW 2 cited by
Estimating the number of clusters using cross-validation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Many clustering methods, including k-means, require the user to specify the number of clusters as an input parameter. A variety of methods have been devised to choose the number of clusters automatically, but they often rely on strong modeling assumptions. This paper proposes a data-driven approach to estimate the number of clusters based on a novel form of cross-validation. The proposed method differs from ordinary cross-validation, because clustering is fundamentally an unsupervised learning problem. Simulation and real data analysis results show that the proposed method outperforms existing methods, especially in high-dimensional settings with heterogeneous or heavy-tailed noise. In a yeast cell cycle dataset, the proposed method finds a parsimonious clustering with interpretable gene groupings.
Forward citations
Cited by 2 Pith papers
-
Number of Clusters in a Dataset: A Regularized K-means Approach
Under ideal spherical clusters, the additive penalty coefficient must satisfy N rho^2 / K < lambda < N L^2 / (2K), and a parameter-free multiplicative penalty naturally favors the true cluster count.
-
Bi-cross validation for estimating spectral clustering hyper parameters
A method using bi-cross validation on the inverted Laplacian matrix to estimate spectral clustering hyperparameters, demonstrated on simulations and LCLS data, but lacking a proof and failing on one synthetic case.
Discussion (0). Continue with ORCID to comment.