Conceptual K-Means Algorithm with Similarity Functions
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.
KeywordsSimilarity Function Qualitative Feature Comparison Function Quantitative Feature Aggregation Step
- 1.Hanson, S.J.: Conceptual clustering and categorization: bridging the gap between induction and causal models. In: Kodratoff, Y., Michalski, R.S. (eds.) Machine Learning: an artificial intelligence approach, vol. 3, pp. 235–268. Morgan Kaufmann, Los Altos (1990)Google Scholar
- 3.Ralambondrainy, H.: A clustering method for nominal data and mixture of numerical and nominal data. In: Proc. First Conf. Internat. Federation of Classification Societies, Aachen (1987)Google Scholar
- 4.García Serrano, J.R., Martínez-Trinidad, J.F.: Extension to k-means algorithm for the use of similarity functions. In: 3rd European Conference on Principles of Data Mining and Knowledge Discovery Proceedings, Prague, Czech. Republic, pp. 354–359 (1999)Google Scholar