VLDB 2026 Research / reviewers in the wild / expert
Zhanpei Huang
dblp:409/3762
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 70% Machine learning and data management · 30% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › clustering
categorical data clustering |
1.0 | 1 | 2026 | Break the Tie: Learning Cluster-Customized Category Relationships for Categorical Data Clustering · AAAI 2026 |
Data mining
clustering |
1.0 | 1 | 2026 | Break the Tie: Learning Cluster-Customized Category Relationships for Categorical Data Clustering · AAAI 2026 |
Machine learning and data management
metric learning |
1.0 | 1 | 2026 | Break the Tie: Learning Cluster-Customized Category Relationships for Categorical Data Clustering · AAAI 2026 |
Data mining › clustering
mixed data clustering |
0.3 | 1 | 2026 | Break the Tie: Learning Cluster-Customized Category Relationships for Categorical Data Clustering · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
euclidean-compatible metric learning · 1.0cluster-customized category relationship learning · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Break the Tie: Learning Cluster-Customized Category Relationships for Categorical Data ClusteringabstractCategorical 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 best-performing methods. Code and extended version with detailed proofs are provided online. Mingjie Zhao 0003, Zhanpei Huang, Yang Lu 0009, Mengke Li 0001, Yiqun Zhang 0006, Weifeng Su, Yiu-Ming Cheung |
AAAI | 2 |
| 2025 | Robust Qualitative Data Clustering via Learnable Multi-Metric Space FusionabstractUnderstanding categorical data with vague qualitative values by forming clusters is crucial in many data-driven AI fields. Compared with numerical data with its quantitative values embedded in well-defined Euclidean distance space, distances of the qualitative values are naturally unknown and are specially defined for certain data types or tasks. This paper, therefore, proposes a distance metric space fusion framework, which learns to fuse multiple distance metrics to form a statistical information-complete and prior knowledge-comprehensive metric for robust and accurate cluster analysis of qualitative data. To better serve various clustering tasks, the metric fusion objective is incorporated into the clustering objective through iterative learning. It turns out that the proposed method stably demonstrates superiority on various challenging real benchmark datasets. Extensive experiments including significance tests, ablation studies, etc. validate its efficacy. Source code of the proposed method is available at https://github.com/Sen-Feng/ICASSP-MSF/tree/main/CODE. Sen Feng, Mingjie Zhao 0003, Zhanpei Huang, Yuzhu Ji, Yiqun Zhang 0006, Yiu-Ming Cheung |
ICASSP | 3 |