The conceptual k-means algorithm consists of two steps. In the first step the clusters are obtained (aggregation step) and in the second one the concepts or properties for those clusters are generated (characterization step). We consider the conceptual k-means management of mixed, qualitative and quantitative, features is inappropriate. Therefore, in this paper, a new conceptual k-means algorithm using similarity functions is proposed. In the aggregation step we propose to use a different clustering strategy, which allows working in a more natural way with object descriptions in terms of quantitative and qualitative features. In addition, an improvement of the characterization step and a new quality measure for the generated concepts are presented. Some results obtained after applying both, the original and the modified algorithms on different databases are shown. Also, they are compared using the proposed quality measure. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Ayaquica-Martínez, I. O., Martínez-Trinidad, J. F., & Carrasco-Ochoa, J. A. (2005). Conceptual k-means algorithm with similarity functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3773 LNCS, pp. 368–376). Springer Verlag. https://doi.org/10.1007/11578079_39
Mendeley helps you to discover research relevant for your work.