A two-phase K-means algorithm for large datasets

Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science

Volumn 218, Issue 10, 2004, Pages 1269-1273

  Pham, D T ^a   Dimov, S S ^a   Nguyen, C D ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

Clustering; Data mining; K means method

Indexed keywords

ALGORITHMS; BUFFER STORAGE; ITERATIVE METHODS;

BUFFERING; DATASETS;

DATA HANDLING;

MATHEMATICAL ANALYSIS;

EID: 8744234867     PISSN: 09544062     EISSN: None     Source Type: Journal    
DOI: 10.1243/0954406042369008     Document Type: Article

References (6)

1. MacQueen, J. B. Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Vol. I, Statistics, Berkeley, California, 1967, pp. 281-297 (University of California Press, Berkeley and Los Angeles, California).
2. Bradley, P., Fayyad, U. M. and Reina, C. Scaling clustering algorithms to large databases. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, New York, 1998, pp. 9-15.
3. Farnstrom, F., Lewis, J. and Elkan, C. Scalability for clustering algorithms revisited, SIGKDD explorations. ACM SIGKDD, 2000, 2(1), 51-57.
4. Pham, D. T., Dimov, S. S. and Nguyen, C. D. Incremental K-means algorithm. Proc. Instn Mech. Engrs, Part C: J. Mechanical Engineering Science, 2004, 218(C7), 783-795.
5. Hettich, S. and Bay, S. D. The UCI KDD Archive (http:/ /kdd.ics.uci.edu). University of California, Department of Information and Computer Science, Irvine, California, 1999.
6. SPSS Clementine Data Mining System, User Guide Version 5, 1998 (Integral Solutions, Basingstoke, Hampshire).