AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

High-dimensional Clustering onto Hamiltonian Cycle

Tianyi Huang, Shenghui Cheng, Stan Z. Li, Zhengjun Zhang

ICML 2023 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 3 citations (OpenAlex)

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 changedWhereMeasuredEffect
add augmentation loss L_a (full GLDC vs w/o L_a) (ablation)GLDC · MNIST, Fashion, Reuters10K, HHAR, Pendigits, BHACC: Fashion 0.715 vs 0.694; Reuters10K 0.834 vs 0.804; HHAR 0.878 vs 0.822Improved
add reconstruction loss L_r (full GLDC vs w/o L_r) (ablation)GLDC · MNIST, Fashion, Reuters10K, HHARACC: Fashion 0.715 vs 0.621; Reuters10K 0.834 vs 0.724; HHAR 0.878 vs 0.765Improved
GLDC clustering loss vs N2D (best prior baseline)GLDC · USPS and PendigitsACC: USPS 0.910 vs 0.958; Pendigits 0.867 vs 0.885Hurt
GLDC clustering vs prior methods overallGLDC · MNIST ACCACC: 0.979 vs N2D 0.979No clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy