activity
20242026
most citedEstimating the Optimal Number of Clusters in Categorical Data Clustering by Silhouette Coefficient

168 citations · 169 across the 4 of their papers we have counts for

collaborators

5 papers

cs.LG2026

Compact set-valued deep ensembling in multi-class classification

Kim-Dung Tran, Dang-Man Nguyen, Vu-Linh Nguyen +3

This paper tackles visible challenges in deep ensemble learning, where deep neural networks serve as ensemble members: training and storage burdens, and robustness of cautious (set…

cs.LG2025

GaussianPSL: Soft partitioning for complex PSL problem

Phuong Mai Dinh, Van-Nam Huynh

Many practical applications of multi-objective optimization (MOO), including engineering design, autonomous systems, and machine learning, often yield complex Pareto frontiers (e.g…

cs.LG2025

Synergistic Fusion of Multi-Source Knowledge via Evidence Theory for High-Entropy Alloy Discovery

Minh-Quyet Ha, Dinh-Khiet Le, Duc-Anh Dao +6

Discovering novel high-entropy alloys (HEAs) with desirable properties is challenging due to the vast compositional space and complex phase formation mechanisms. Efficient explorat…

cs.LG2025★ 168 cited

Estimating the Optimal Number of Clusters in Categorical Data Clustering by Silhouette Coefficient

Duy-Tai Dinh, Tsutomu Fujinami, Van-Nam Huynh

The problem of estimating the number of clusters (say k) is one of the major challenges for the partitional clustering. This paper proposes an algorithm named k-SCC to estimate the…

cs.LG2024★ 1 cited

Categorical data clustering: 25 years beyond K-modes

Tai Dinh, Wong Hauchi, Philippe Fournier-Viger +4

The clustering of categorical data is a common and important task in computer science, offering profound implications across a spectrum of applications. Unlike purely numerical dat…