Global k-means with similarity functions

Authors:
Saúl López-Escobar;J. A. Carrasco-Ochoa;J. Fco. Martínez-Trinidad
Affiliations:
National Institute for Astrophysics, Optics and Electronics, Sta. Ma. Tonantzintla, Puebla, México;National Institute for Astrophysics, Optics and Electronics, Sta. Ma. Tonantzintla, Puebla, México;National Institute for Astrophysics, Optics and Electronics, Sta. Ma. Tonantzintla, Puebla, México
Venue:
CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
Year:
2005

Citing 1
Cited 1

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

Fast global k-means with similarity functions algorithm

IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The k-means algorithm is a frequently used algorithm for solving clustering problems. This algorithm has the disadvantage that it depends on the initial conditions, for that reason, the global k-means algorithm was proposed to solve this problem. On the other hand, the k-means algorithm only works with numerical features. This problem is solved by the k-means algorithm with similarity functions that allows working with qualitative and quantitative variables and missing data (mixed and incomplete data). However, this algorithm still depends on the initial conditions. Therefore, in this paper an algorithm to solve the dependency on initial conditions of the k-means algorithm with similarity functions is proposed, our algorithm is tested and compared against k-means algorithm with similarity functions.