An enhancement of K-means clustering algorithm

2009 International Conference on Business Intelligence and Financial Engineering, BIFE 2009

Volumn , Issue , 2009, Pages 237-240

  Jirong, Gu ^a   Jieming, Zhou ^a   Xianwei, Chen ^b  

^a SICHUAN NORMAL UNIVERSITY   (China)

^b Infomation Center of Land Resources Chengdu   (China)

Author keywords

Clustering; K means; Partitional clustering; Refining initial points

Indexed keywords

CLUSTERING; CLUSTERING RESULTS; DATA SETS; DISTANCE MEASURE; EXECUTION TIME; INITIAL CONDITIONS; INITIAL POINT; K CLUSTER; K-MEANS; K-MEANS ALGORITHM; K-MEANS CLUSTERING ALGORITHM; LARGE DATA; NUMBER OF CLUSTERS; PARTITIONAL CLUSTERING; SAMPLE DATA; SEED POINT;

INFORMATION DISSEMINATION; REFINING; WATER SUPPLY SYSTEMS;

CLUSTERING ALGORITHMS;

EID: 71049130793     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIFE.2009.204     Document Type: Conference Paper

References (6)

1. J. Han and M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, San Francisco, CA, 2001.
2. M. Ester, H. P. Kriegel, J. Sander, and X. Xu, "A density-based algorithm for discovering clusters in large spatial databases", Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining (KDD'96), Portland, OR, August 1996.
3. P. S. Bradley and U. M. Fayyad, "Refining initial points for K-means clustering", Proceedings of the Fifteenth International Conference on Machine Learning (ICML98), 1998, pp. 91-99.
4. The Analysis of a Simple K-Means Algorithm. T. Kanungo, D.M. Mount, N.S. Netanyahu, C. Piatko, R. Silverman and A.Y. Wu. 2000
5. R. Kannan, S. Vempala, and Adrian Vetta, "On Clusterings: Good, Bad, and Spectral", Proc. of the 41st Foundations of Computer Science, Redondo Beach, 2000.
6. S. Kantabutra, Efficient Representation of Cluster Structure in Large Data Sets, Ph.D. Thesis, Tufts University, Medford, MA, September 2001.