Research map / Learning theory and algorithms / Clustering
High-dimensional Clustering onto Hamiltonian Cycle
Tianyi Huang, Shenghui Cheng, Stan Z. Li, Zhengjun Zhang
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 augmentation loss L_a (full GLDC vs w/o L_a) (ablation) | GLDC · MNIST, Fashion, Reuters10K, HHAR, Pendigits, BH | ACC: Fashion 0.715 vs 0.694; Reuters10K 0.834 vs 0.804; HHAR 0.878 vs 0.822 | Improved |
| add reconstruction loss L_r (full GLDC vs w/o L_r) (ablation) | GLDC · MNIST, Fashion, Reuters10K, HHAR | ACC: Fashion 0.715 vs 0.621; Reuters10K 0.834 vs 0.724; HHAR 0.878 vs 0.765 | Improved |
| GLDC clustering loss vs N2D (best prior baseline) | GLDC · USPS and Pendigits | ACC: USPS 0.910 vs 0.958; Pendigits 0.867 vs 0.885 | Hurt |
| GLDC clustering vs prior methods overall | GLDC · MNIST ACC | ACC: 0.979 vs N2D 0.979 | No clear effect |
Closest papers by meaning
- Atoms and Pivot Based Correlation Clustering (NeurIPS 2026 · similarity 0.86)
- FC$^{2}$2: Fast Co-Clustering With Small-Scale Similarity Graph and Bipartite Graph Learning (TPAMI 2026 · similarity 0.84)
- Enhanced Denesity Peak Clustering for High-Dimensional Data (AAAI 2025 · similarity 0.83)
- Hierarchical Overlapping Clustering on Graphs: Cost Function, Algorithm and Scalability (ICML 2025 · similarity 0.83)
- Online Sparsification of Bipartite-Like Clusters in Graphs (ICML 2025 · similarity 0.83)
- Ultrametric Cluster Hierarchies: I Want ‘em All! (NeurIPS 2025 · similarity 0.83)
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.
