Categorical Data Clustering via Value Order Estimated Distance Metric Learning
Summary: Introduces an order-distance metric that learns optimal ordinal relationships among categorical values by embedding them on a line to induce Euclidean-like distances for clustering. Proposes an alternating joint clustering–metric-learning algorithm with convergence and low cost, improving accuracy and interpretability on categorical and mixed data. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yiqun Zhang
- 2. Mingjie Zhao
- 3. Hong Jia
- 4. Mengke Li
- 5. Yang Lu
- 6. Yiu-ming Cheung
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,336 | Clustering Categorical Data: An Approach Based on Dynamical Systems | 1998 | VLDB | 0.00012498064 |
| 5,827 | On Graph Representation for Attributed Hypergraph Clustering | 2025 | SIGMOD | 5.3113542e-05 |
| 6,894 | TableDC: Deep Clustering for Tabular Data | 2025 | SIGMOD | 4.8925595e-05 |
Previous
Page 1 / 1
Next