Research map / Graph learning / Graph algorithms and clustering
An Euclidean Distance Based on Tensor Product Graph Diffusion Related Attribute Value Embedding for Nominal Data Clustering
Lei Gu, Ningning Zhou, Yang Zhao
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add kNN information and tensor product graph diffusion (TAVE vs AVE) (ablation) | attribute value embedding with K-means · Solar Data1 | F-score: 0.6528 -> 0.7631 | Improved |
| add kNN information and tensor product graph diffusion (TAVE vs AVE) (ablation) | attribute value embedding with K-means · Chess(KRvsKP) | F-score: 0.5322 -> 0.6425 | Improved |
| add kNN information and tensor product graph diffusion (TAVE vs AVE) (ablation) | attribute value embedding with K-means · Tic | F-score: 0.5822 -> 0.5420 | Hurt |
| add kNN information and tensor product graph diffusion (TAVE vs AVE) (ablation) | attribute value embedding with K-means · Balance | NMI: 0.0392 -> 0.0711 | Improved |
| add kNN information and tensor product graph diffusion (TAVE vs AVE) (ablation) | attribute value embedding with K-means · German | NMI: 0.0246 -> 0.0065 | Hurt |
| add kNN information and tensor product graph diffusion (TAVE vs AVE) (ablation) | attribute value embedding with K-means · CMC | NMI: 0.0311 -> 0.0194 | Hurt |
| use TAVE instead of CDE embedding | K-means · Tae | F-score: 0.3856 -> 0.4226 | Improved |
| use TAVE instead of CDE embedding | K-means · Liver | NMI: 0.0257 -> 0.0231 | Hurt |
| use TAVE instead of CDE embedding | K-means · German, Chess(KRvsKP) | embedding dimensions | Improved |
| use TAVE instead of HAM distance with K-modes | K-modes / K-means · Chess(KRvsK) | F-score: 0.1040 -> 0.1270 | Improved |
| use TAVE instead of CDE on independent-attribute data | K-means · Monks | F-score: 0.5211 -> 0.5263 | Improved |
| use CNS or ADM distance on data with independent attributes | K-modes · Monks, Balance | F-score | Hurt |
Closest papers by meaning
- Learnable Weighting of Intra-attribute Distances for Categorical Data Clustering with Nominal and Ordinal Attributes (TPAMI 2021 · similarity 0.87)
- Self-Supervised Graph Embedding Clustering (TPAMI 2025 · similarity 0.85)
- Graph Minimum Factor Distance and Its Application to Large-Scale Graph Data Clustering (ICML 2025 · similarity 0.83)
- Hybrid-Collaborative Augmentation and Contrastive Sample Adaptive-Differential Awareness for Robust Attributed Graph Clustering (NeurIPS 2025 · similarity 0.83)
- Hierarchical Correlation Clustering and Tree Preserving Embedding (CVPR 2024 · similarity 0.83)
- Attribute-Missing Graph Clustering Network (AAAI 2024 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
