An efficient k′-means clustering algorithm

Pattern Recognition Letters

Volumn 29, Issue 9, 2008, Pages 1385-1391

  Žalik, Krista Rizman ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Cluster number; Clustering analysis; Cost function; k Means; Rival penalized

Indexed keywords

COMPUTER SIMULATION; COST FUNCTIONS; GLOBAL OPTIMIZATION; ITERATIVE METHODS; MEAN SQUARE ERROR;

SEED POINTS; SIMULATED EXPERIMENTS;

CLUSTERING ALGORITHMS;

EID: 43249119791     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2008.02.014     Document Type: Article

References (19)

1. Ahalt S.C., Krishnamurty A.K., Chen P., and Melton D.E. Competitive algorithms for vector quantization. Neural Networks 3 (1990) 277-291
2. Akaike, H., 1973. Information theory and an extension of the maximum likelihood principle. In: Proc. 2nd Internat. Symp. on Information Theory, pp. 267-281.
3. Bezdek J. Pattern Recognition with Fuzzy Objective Function Algorithms (1981), Plenum Press, New York
4. Blake, C.L., Merz, C.J., 1998. UCI Repository for machine learning databases, Irvine Dept. Inf. Comput. Sci., Univ. California [Online]. .
5. Bozdogan H. Model selection and Akaike's information criterion the general theory and its analytical extensions. Psyhometrika 52 (1987) 345-370
6. Cheug Y.M. On rival penalization controlled competitive learning for clustering with automatic cluster number selection. IEEE Trans. Knowledge Data Eng. 17 (2005) 1583-1588
7. Khan S., and Ahmad A. Cluster centre initialization algorithm for k-means clustering. Pattern Recognition Lett. 25 (2004) 1293-1302
8. Laszlo M., and Mukherjee S. A genetic algorithm that exchanges neighbouring centres for k-means clustering. Pattern Recognition Lett. 28 (2007) 2359-2366
9. Law, L.T., Cheung, Y.M., 2003. Colour image segmentation using rival penalized controlled competitive learning. In: Proc. 2003 Internat. Joint Conf. on Neural Networks (IJCNN'2003), Portland, Oregon, USA, pp. 20-24.
10. Ma J., and Cao B. The Mahalanobis distance based rival penalized competitive learning algorithm. Lect. Note Comput. Sci. 3971 (2006) 442-447
11. MacQueen J.B. Some methods for clustering and analysis of multivariate observations. Proc. 5th Berkeley Symp. on Math. Statist. Prob. vol. 1 (1967), University of California Press, Berkeley 281-297
12. Oliver, J., Baxter, R., Wallace, C., 1996. Unsupervised learning using MML. In: Proc. 13th Internat. Conf. on Mach. Learn., pp. 364-372.
13. Redmond S.J., and Heneghan C. A method for initializing the k-means clustering algorithm using kd-trees. Pattern Recognition Lett. 28 (2007) 965-973
14. Roberts S.J., Everson R., and Rezek I. Maximum certainty data partitioning. Pattern Recognition 33 (2000) 833-839
15. Schwarz G. Estimating the dimension of a model. Ann. Statist. 6 (1978) 461-464
16. Steinley D., and Brusco M.J. Initialization k-means batch clustering: a critical evaluation of several techniques. J. Classif. 24 (2007) 99-121
17. Wallace C., and Dowe D. Minimum message length and Kolmogorov complexity. Comput. J. 42 (1999) 270-283
18. Xu L. Rival penalized competitive learning for cluster analysis, RBF net and curve detection. IEEE Trans. Neural Network 4 (1993) 636-648
19. Xu L. Bayesian Ying-Yang machine, clustering and number of clusters. Pattern Recognition Lett. 18 (1997) 1167-1178