Fast Global k-Means with Similarity Functions Algorithm
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.
KeywordsObjective Function Local Search Similarity Function Global Solution Numerical Feature
Unable to display preview. Download preview PDF.
- Serrano, J.R.G., Martínez-Trinidad, J.F.: Extension to c-Means Algorithm for the Use of Similarity Functions. In: 3rd European Conference on Principles and Practice of Knowledge Discovery in Databases Proceedings, Prague, Czech Rep, pp. 354–359 (1999)Google Scholar
- Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases, University of California, Irvine, Departament of Information and Computer Sciences (1998)Google Scholar
- Bradley, P.S., Fayyad, U.M.: Refining Initial Points for k-Means Clustering. In: Proceedings of the 15th International Conference on Machine Learning, San Francisco, CA, pp. 91–98 (1998)Google Scholar