A new algorithm to get the initial centroids

Proceedings of 2004 International Conference on Machine Learning and Cybernetics

Volumn 2, Issue , 2004, Pages 1191-1193

  Yuan, Fang ^a,b   Meng, Zeng Hui ^b   Zhang, Hong Xia ^b,c   Dong, Chun R U ^b  

^a NORTHEASTERN UNIVERSITY   (China)

^b HEBEI UNIVERSITY   (China)

^c Baoding College   (China)

Author keywords

Clustering; K means clustering algorithm; Pattern recognition

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; MEMBERSHIP FUNCTIONS; PATTERN RECOGNITION; PROBLEM SOLVING; RANDOM PROCESSES; VECTOR QUANTIZATION; VECTORS;

CLUSTERING; DATA-POINTS; EUCLIDEAN DISTANCE; K-MEANS CLUSTERING ALGORITHMS;

ALGORITHMS;

EID: 6344280257     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. A.Baraldi International Computer Science Institute; P.Blonda. A Survey of Fuzzy Clustering. International Computer Science Institute. 1998.
2. A.Baraldi International Computer Science Institute; P.Blonda. A Survey of Fuzzy Clustering. International Computer Science Institute. 1998.
3. Léon Bottou. Neuristique. Yoshua Bengio, Dept, IRO, IESI-CNR. Convergence Properties of the k-means algorithms.
4. La Jolla, Department of Computer Science and Engineering, University of California, San Diego. Alternatives to the k-means algorithm that find better clustering., CA92093.
5. Dzung Pham, Department of Electrical and Computer Engineering, the Johns Hopkins University, Baltimore MD 21218;
6. Jerry L. Prince, Azar P, etc.. An Automated Technique for Statistical Characterization of Brain Tissues in Magnetic Resonance Imaging. Technical Report JHU/ECE 96-13.
7. Zhu Ming. Data Mining. University of Science and Technology of China press.
8. Fredrik Farnstrom. Computer Science and Engineering Lund Institute of Technology Sweden;James Lewis, Computer Science and Engineering, University of California San Diego;Charles Elkan, Computer Science and Engineering, University of California San Diego. Scalability for Clustering Algorithms Revisited.
9. Fredrik Farnstrom. Computer Science and Engineering Lund Institute of Technology Sweden;James Lewis, Computer Science and Engineering, University of California San Diego;Charles Elkan, Computer Science and Engineering, University of California San Diego. Scalability for Clustering Algorithms Revisited.
10. Fredrik Farnstrom. Computer Science and Engineering Lund Institute of Technology Sweden;James Lewis, Computer Science and Engineering, University of California San Diego;Charles Elkan, Computer Science and Engineering, University of California San Diego. Scalability for Clustering Algorithms Revisited.
11. Geoffrey J.Gordon, Andrew Moore. Robotics Institute, Carnegie Mellon University, Learning Filaments.
12. Merz C. and Murphy P.. UCI Repository of Machine Learning Databases. Available Online from ftp://ftp.ics.uci.edu/pub/machine-learning-databases, 1996.