Fast global k-means with similarity functions algorithm

Authors:
López-Escobar Saúl;J. A. Carrasco-Ochoa;Martínez-Trinidad J. Fco
Affiliations:
National Institute for Astrophysics, Optics and Electronics, Tonantzintla, Puebla, México;National Institute for Astrophysics, Optics and Electronics, Tonantzintla, Puebla, México;National Institute for Astrophysics, Optics and Electronics, Tonantzintla, Puebla, México
Venue:
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Year:
2006

Citing 6
Cited 2

An empirical comparison of four initialization methods for the K-Means algorithm

Pattern Recognition Letters
Refining Initial Points for K-Means Clustering

ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Extension to C-means Algorithm for the Use of Similarity Functions

PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Cluster center initialization algorithm for K-means clustering

Pattern Recognition Letters
Unsupervised clustering on dynamic databases

Pattern Recognition Letters
Global k-means with similarity functions

CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications

Using document structure for automatic summarization

Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
CBSEAS, a summarization system integration of opinion mining techniques to summarize blogs

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session

Quantified Score

Hi-index	0.00

Visualization

Abstract

The global k-means with similarity functions algorithm is an algorithm that allows working with qualitative and quantitative features (mixed data), but it involves a heavy computational cost. Therefore, in this paper, an algorithm that accelerates the global k-means with similarity functions algorithm without significantly affecting the quality of the solution is proposed. Our algorithm called fast global k-means with similarity functions algorithm is tested and compared against the k-means with similarity functions algorithm and the global k-means with similarity functions algorithm.