Skip to content
Open access

Parallelogram-mode: A novel clustering method for categorical data

Sep 2026 · Applied Computer Science · Vol 22, pp. 62-81 · 0 citations · 24 references

TL;DR

This paper forms categorical data clustering as a rule-set search task that manipulates high-dimensional vector representations of entities in the input dataset and proposes an efficient and effective algorithm called “Coupling-Sorting-Branching” to solve the search task.

Abstract

The need for clustering methods that treat the interpretability of clustering results as valuable as cluster correctness is particularly important in high-risk domains. The heterogeneous nature of categorical data makes its clustering results less interpretable than those for numerical data.  This challenge is amplified by the scarcity of works investigating the clustering of categorical data. Existing interpretable categorical data clustering algorithms do not optimise for scalability. In this paper, we address the scalability limitation by employing a vectorial approach to interpretable categorical data clustering that takes full advantage of the computational acceleration offered by modern computing hardware, such as GPUs. We formulate categorical data clustering as a rule-set search task that manipulates high-dimensional vector representations of entities in the input dataset. We propose an efficient and effective algorithm called “Coupling-Sorting-Branching” to solve the search task. This approach provides a scalable and fully interpretable method for clustering categorical data. Extensive experimental results across 14 real-world datasets demonstrate that our algorithm outperforms existing methods in cluster quality and explainability by producing IF-THEN rules.

Read PDF

Similar papers

Open access Oct 2026

A Scalable Clustering-Based Approach for Efficient Mining of Large Datasets

Clustering is an unsupervised machine learning technique used to identify and group similar data points within large datasets without relying on predefined class labels or target outcomes. It plays an important role in data mining by facilitating the discovery of meaningful groups, hidden patterns, and relevant data di...

Harshita Koushal, Dr. Harsh Lohiya, Mr. Manoj Kuma · 0 citations
Review Open access Nov 2026

From "Birds of a Feather" to Data Insights: The Principles, Methods and Applications of Hierarchical Clustering Algorithms

Cluster analysis aims to group similar objects into the same cluster. Hierarchical clustering, as an important method, does not produce a single grouping result but instead constructs a clustering tree that simultaneously presents the grouping structure of the data at different levels of granularity. This paper focuses...

Le Yang · 0 citations
Review Open access Oct 2026

A Selective Review of Statistical Significance in Cluster Analysis

Cluster analysis can return apparent subgroups even when the observations arise from a population without scientifically meaningful cluster structure. Formal tests of clustering significance therefore require a definition of homogeneity, a statistic measuring the observed structure, and a calibration procedure that acc...

Yi-Fan Dai, Hui Shen, Yu-Feng Liu · 0 citations
Review Open access Sep 2026

Hybrid clustering framework for large-scale scientific literature structuring

This study addresses the challenge of organizing and interpreting large collections of scientific literature, focusing on a rapidly growing and heterogeneous AI research domain derived from object-detection-with-small-data literature. First, based on the set of keywords using Clarivate Analytics queries, over 18,500 re...

Dmytro Teplov, Artur Radzivil, Andrej Bugajev · 0 citations
Open access 2024

Enhanced Cluster Ensemble Approach Using Multiple Attributes in Unreliable Categorical Data

Cluster analysis is an efficient tool to identify useful and user-preferable data patterns from categorical data streams. Conventional clustering approaches focused on numerical with single attribute relations from categorical data. Existing approaches perform poorly and have low complexity to combine relative attribut...

D. B. Mandru, Y. K. Sundara Krishna · 0 citations
Open access Sep 2026

Sparse k-Means Clustering with Lasso-Based Feature Selection

Clustering high-dimensional data is challenging when irrelevant or weakly informative features obscure the underlying cluster structure. To address this issue, we propose two sparse k-means clustering algorithms, S-KM1 and S-KM2, that perform cluster estimation and feature selection by sparse feature weighting simultan...

Miin-Shen Yang, Shazia Parveen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.