Extended K-means with an Efficient Estimation of the Number of Clusters
暂无分享，去创建一个
[1] Andrew W. Moore,et al. X-means: Extending K-means with Efficient Estimation of the Number of Clusters , 2000, ICML.
[2] Esa Alhoniemi,et al. Clustering of the self-organizing map , 2000, IEEE Trans. Neural Networks Learn. Syst..
[3] Andrew W. Moore,et al. Accelerating exact k-means algorithms with geometric reasoning , 1999, KDD '99.
[4] Narendra Ahuja,et al. A data partition method for parallel self-organizing map , 1999, IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339).
[5] Esa Alhoniemi,et al. Self-organizing map in Matlab: the SOM Toolbox , 1999 .
[6] A. Hardy. On the number of clusters , 1996 .
[7] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.
[8] Jon Louis Bentley,et al. Multidimensional divide-and-conquer , 1980, CACM.
[9] J. A. Hartigan,et al. A k-means clustering algorithm , 1979 .
[10] Maurice K. Wong,et al. Algorithm AS136: A k-means clustering algorithm. , 1979 .
[11] G. Schwarz. Estimating the Dimension of a Model , 1978 .
[12] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .