Adaptive Sparse Clustering of Mixed Data Using Azzalini-Encoded Ordinal Variables

In this paper, we propose a novel sparse clustering method designed for high-dimensional mixed-type data, integrating Azzalini’s score-based encoding for ordinal variables. Our approach aims to retain the inherent nature of each variable type—continuous, ordinal, and nominal—while enhancing clustering quality and interpretability. To this end, we extend classical distance metrics and adapt the Davies–Bouldin Index (DBI) to better reflect the structure of mixed data. We also introduce a weighted formulation that accounts for the distinct contributions of variable types in the clustering process. Empirical results on simulated and real-world datasets demonstrate that our method consistently achieves better separation and coherence of clusters compared to traditional techniques, while effectively identifying the most informative variables. This work opens promising directions for clustering in complex, high-dimensional settings such as marketing analytics and customer segmentation.

Authors

Institutions

Publication Details

Journal
Axioms
Published
2025-12-07
DOI
https://doi.org/10.3390/axioms14120902
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Adaptive Sparse Clustering of Mixed Data Using Azzalini-Encoded Ordinal Variables

Echarif Elharfaoui, Mohamed Alahiane, Mustapha Rachdi, Ismail Arjdal
Axioms
Advanced Clustering Algorithms Research
article

Adaptive Sparse Clustering of Mixed Data Using Azzalini-Encoded Ordinal Variables

Echarif Elharfaoui, Mohamed Alahiane, Mustapha Rachdi, Ismail Arjdal
article en

Abstract

In this paper, we propose a novel sparse clustering method designed for high-dimensional mixed-type data, integrating Azzalini’s score-based encoding for ordinal variables. Our approach aims to retain the inherent nature of each variable type—continuous, ordinal, and nominal—while enhancing clustering quality and interpretability. To this end, we extend classical distance metrics and adapt the Davies–Bouldin Index (DBI) to better reflect the structure of mixed data. We also introduce a weighted formulation that accounts for the distinct contributions of variable types in the clustering process. Empirical results on simulated and real-world datasets demonstrate that our method consistently achieves better separation and coherence of clusters compared to traditional techniques, while effectively identifying the most informative variables. This work opens promising directions for clustering in complex, high-dimensional settings such as marketing analytics and customer segmentation.

AxiomsVol. 14(12)
Chouaib Doukkali University (MA), Université Grenoble Alpes (FR)
Openalex Percentile: Top 79%
Advanced Clustering Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Adaptive Sparse Clustering of Mixed Data Using Azzalini-Encoded Ordinal Variables — Echarif Elharfaoui, Mohamed Alahiane, et al. · Axioms (2025) | TGRS Research Map | TGRS