A SELF-ORGANIZING MAP FOR MIXED CONTINUOUS AND CATEGORICAL DATA

  • Rogovschi N
  • Lebbah M
  • Bennani Y
N/ACitations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Most traditional clustering algorithms are limited to handle data sets that contain either continuous or categorical variables. However data sets with mixed types of variables are commonly used in data mining field. In this paper we introduce a weighted self-organizing map for clustering, analysis and visualization mixed data (continuous/binary). The learning of weights and prototypes is done in a simultaneous manner assuring an optimized data clustering. More variables has a high weight, more the clustering algorithm will take into account the informations transmitted by these variables. The learning of these topological maps is combined with a weighting process of different variables by computing weights which influence the quality of clustering. We illustrate the power of this method with data sets taken from a public data set repository: a handwritten digit data set, Zoo data set and other three mixed data sets. The results show a good quality of the topological ordering and homogenous clustering.

Cite

CITATION STYLE

APA

Rogovschi, N., Lebbah, M., & Bennani, Y. (2011). A SELF-ORGANIZING MAP FOR MIXED CONTINUOUS AND CATEGORICAL DATA. International Journal of Computing, 24–32. https://doi.org/10.47839/ijc.10.1.733

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free