Break the Tie: Learning Cluster-Customized Category Relationships for Categorical Data Clustering

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Zhao, Mingjie, Huang, Zhanpei, Lu, Yang, Li, Mengke, Zhang, Yiqun, Su, Weifeng, Cheung, Yiu-ming
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908647676706816
author Zhao, Mingjie
Huang, Zhanpei
Lu, Yang
Li, Mengke
Zhang, Yiqun
Su, Weifeng
Cheung, Yiu-ming
author_facet Zhao, Mingjie
Huang, Zhanpei
Lu, Yang
Li, Mengke
Zhang, Yiqun
Su, Weifeng
Cheung, Yiu-ming
contents Categorical attributes with qualitative values are ubiquitous in cluster analysis of real datasets. Unlike the Euclidean distance of numerical attributes, the categorical attributes lack well-defined relationships of their possible values (also called categories interchangeably), which hampers the exploration of compact categorical data clusters. Although most attempts are made for developing appropriate distance metrics, they typically assume a fixed topological relationship between categories when learning distance metrics, which limits their adaptability to varying cluster structures and often leads to suboptimal clustering performance. This paper, therefore, breaks the intrinsic relationship tie of attribute categories and learns customized distance metrics suitable for flexibly and accurately revealing various cluster distributions. As a result, the fitting ability of the clustering algorithm is significantly enhanced, benefiting from the learnable category relationships. Moreover, the learned category relationships are proved to be Euclidean distance metric-compatible, enabling a seamless extension to mixed datasets that include both numerical and categorical attributes. Comparative experiments on 12 real benchmark datasets with significance tests show the superior clustering accuracy of the proposed method with an average ranking of 1.25, which is significantly higher than the 5.21 ranking of the current best-performing method.
format Preprint
id arxiv_https___arxiv_org_abs_2511_09049
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Break the Tie: Learning Cluster-Customized Category Relationships for Categorical Data Clustering
Zhao, Mingjie
Huang, Zhanpei
Lu, Yang
Li, Mengke
Zhang, Yiqun
Su, Weifeng
Cheung, Yiu-ming
Machine Learning
Artificial Intelligence
Categorical attributes with qualitative values are ubiquitous in cluster analysis of real datasets. Unlike the Euclidean distance of numerical attributes, the categorical attributes lack well-defined relationships of their possible values (also called categories interchangeably), which hampers the exploration of compact categorical data clusters. Although most attempts are made for developing appropriate distance metrics, they typically assume a fixed topological relationship between categories when learning distance metrics, which limits their adaptability to varying cluster structures and often leads to suboptimal clustering performance. This paper, therefore, breaks the intrinsic relationship tie of attribute categories and learns customized distance metrics suitable for flexibly and accurately revealing various cluster distributions. As a result, the fitting ability of the clustering algorithm is significantly enhanced, benefiting from the learnable category relationships. Moreover, the learned category relationships are proved to be Euclidean distance metric-compatible, enabling a seamless extension to mixed datasets that include both numerical and categorical attributes. Comparative experiments on 12 real benchmark datasets with significance tests show the superior clustering accuracy of the proposed method with an average ranking of 1.25, which is significantly higher than the 5.21 ranking of the current best-performing method.
title Break the Tie: Learning Cluster-Customized Category Relationships for Categorical Data Clustering
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2511.09049