Abstract
The C-Means algorithm has been motive of many extensions since the first publications. The extensions until now consider mainly the following aspects: the selection of initial seeds (centers); the determination of the optimal number of clusters and the use of different functionals for generate the clusters. In this paper it is proposed an extension to the C-means algorithm which considers description of the objects (data) with quantitative and qualitative features, besides consider missing data. These types of descriptions are very frequent in soft sciences as Medicine, Geology, Sociology, Marketing, etc. so the application scope for the proposed algorithm is very wide. The proposed algorithm use similarity functions that may be in function of partial similarity functions consequently allows comparing objects analyzing subdescriptions of the same. Results using standard public databases [2] are showed. In addition, a comparison with classical C-Means algorithm [7] is provided.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. John Wiley & Sons, Inc., USA (1973)
Ralambondrainy, H.: quotedblbaseA conceptual version of the K-means algorithm. Pattern Recognition Letters, 16th edn., pp. 1147–1157.
Shulcloper, J.R., et al.: Introducción al reconocimiento de patrones (Enfoque Lógico Combinatorio) Serie Verde No. 51, México, Depto. de Ingeniería Eléctrica, Sec. Computación CINVESTAV-IPN (1995)
Ruspini, E.R.: A new approach to clustering. En: Information and control 15, 22–32 (1969)
Schalkoff, R.J.: Pattern Recognition: Statistical, Structural and Neuronal Approaches. John Wiley & Sons, Inc., USA (1992)
Ball, G., Hall, D.: A Clustering technique for summarizing multivariate data. Behav. Sci. 12, 153–155 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
García-Serrano, J.R., Martínez-Trinidad, J.F. (1999). Extension to C-means Algorithm for the Use of Similarity Functions. In: Żytkow, J.M., Rauch, J. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 1999. Lecture Notes in Computer Science(), vol 1704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48247-5_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-48247-5_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66490-1
Online ISBN: 978-3-540-48247-5
eBook Packages: Springer Book Archive