Conceptual k-means algorithm with similarity functions

  • Authors:
  • I. O. Ayaquica-Martínez;J. F. Martínez-Trinidad;J. A. Carrasco-Ochoa

  • Affiliations:
  • Computer Science Department, National Institute of Astrophysics, Optics and Electronics, Santa María Tonantzintla, Puebla, Mexico;Computer Science Department, National Institute of Astrophysics, Optics and Electronics, Santa María Tonantzintla, Puebla, Mexico;Computer Science Department, National Institute of Astrophysics, Optics and Electronics, Santa María Tonantzintla, Puebla, Mexico

  • Venue:
  • CIARP'05 Proceedings of the 10th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis and Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.