PG-means: learning the number of clusters in data
暂无分享,去创建一个
[1] L. Wasserman,et al. A Reference Bayesian Test for Nested Hypotheses and its Relationship to the Schwarz Criterion , 1995 .
[2] G. Schwarz. Estimating the Dimension of a Model , 1978 .
[3] F. Massey. The Kolmogorov-Smirnov Test for Goodness of Fit , 1951 .
[4] Sanjoy Dasgupta,et al. Experiments with Random Projection , 2000, UAI.
[5] Greg Hamerly,et al. Learning the k in k-means , 2003, NIPS.
[6] Leland Wilkinson,et al. An Analytic Approximation to the Distribution of Lilliefors's Test Statistic for Normality , 1986 .
[7] Marina Meila,et al. Comparing Clusterings by the Variation of Information , 2003, COLT.
[8] Andrew W. Moore,et al. Repairing Faulty Mixture Models using Density Estimation , 2001, ICML.
[9] Naonori Ueda,et al. Deterministic annealing EM algorithm , 1998, Neural Networks.
[10] Andrew W. Moore,et al. X-means: Extending K-means with Efficient Estimation of the Number of Clusters , 2000, ICML.
[11] J. Rissanen,et al. Modeling By Shortest Data Description* , 1978, Autom..
[12] H. Akaike. A new look at the statistical model identification , 1974 .
[13] Robert Tibshirani,et al. Estimating the number of clusters in a data set via the gap statistic , 2000 .
[14] H. Lilliefors. On the Kolmogorov-Smirnov Test for Normality with Mean and Variance Unknown , 1967 .