Learning-Based Dissimilarity for Clustering Categorical Data

• Main Authors: Edgar Jacob Rivera Rios, Miguel Angel Medina-Pérez, Manuel S. Lazo-Cortés, Raúl Monroy
• Format: Article
• Language: English
• Published: MDPI AG 2021-04-01
• Series: Applied Sciences
• Subjects: dissimilarity; categorical data; clustering
• Online Access: https://www.mdpi.com/2076-3417/11/8/3509

Comparing data objects is at the heart of machine learning. For continuous data, object dissimilarity is usually taken to be object distance; however, for categorical data, there is no universal agreement, for categories can be ordered in several different ways. Most existing category dissimilarity measures characterize the distance among the values an attribute may take using precisely the number of different values the attribute takes (the attribute space) and the frequency at which they occur. These kinds of measures overlook attribute interdependence, which may provide valuable information when capturing per-attribute object dissimilarity. In this paper, we introduce a novel object dissimilarity measure that we call <i>Learning-Based Dissimilarity</i>, for comparing categorical data. Our measure characterizes the distance between two categorical values of a given attribute in terms of how likely it is that such values are confused or not when all the dataset objects with the remaining attributes are used to predict them. To that end, we provide an algorithm that, given a target attribute, first learns a classification model in order to compute a confusion matrix for the attribute. Then, our method transforms the confusion matrix into a per-attribute dissimilarity measure. We have successfully tested our measure against 55 datasets gathered from the University of California, Irvine (UCI) Machine Learning Repository. Our results show that it surpasses, in terms of various performance indicators for data clustering, the most prominent distance relations put forward in the literature.