Research map / Learning theory and algorithms / Clustering
On Order-Constrained Transitive Distance Clustering
Zhiding Yu, Weiyang Liu, Wenbo Liu, Yingzhen Yang, Ming Li, B. V. K. Vijaya Kumar
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 |
|---|---|---|---|
| replace TD+SVD with OCTD (Min) | TD+SVD · Aggregation | clustering accuracy (%): 87.94 -> 99.87 | Improved |
| replace TD+SVD with OCTD (Min) | TD+SVD · Bridge | clustering accuracy (%): 60.78 -> 99.57 | Improved |
| replace TD+SVD with OCTD (Min) | TD+SVD · Gaussian | clustering accuracy (%): 78.6 -> 95.33 | Improved |
| replace TD+SVD with OCTD (Min) | TD+SVD · Pathbased | clustering accuracy (%): 96.99 -> 96.66 | No clear effect |
| replace TD with OCTD (Min) | TD · USPS | clustering accuracy (%): 54.31 -> 85.13 | Improved |
| replace TD with OCTD (Min) | TD · ExYB | clustering accuracy (%): 82.81 -> 90.64 | Improved |
| replace TD with OCTD (Min) | TD · AR | clustering accuracy (%): 83.85 -> 88.28 | Improved |
| replace TD+SVD with OCTD (Min) | TD+SVD · NIST Combined | clustering accuracy (%): 72.07 -> 80.89 | Improved |
| replace TD+SVD with OCTD (Min) | TD+SVD · Switch Board | clustering accuracy (%): 78.73 -> 87.53 | Improved |
| replace TD+SVD with OCTD (Min) | TD+SVD · NIST 06 | clustering accuracy (%): 87.07 -> 88.29 | Improved |
| use mean-pooling instead of min-pooling in OCTD | OCTD (Min) · Switch Board | clustering accuracy (%): 87.53 -> 90.88 | Improved |
| use mean-pooling instead of min-pooling in OCTD | OCTD (Min) · NIST Combined | clustering accuracy (%): 80.89 -> 77.24 | Hurt |
Closest papers by meaning
- Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints (AAAI 2021 · similarity 0.83)
- Transport Clustering: Solving Low-Rank Optimal Transport via Clustering (ICML 2026 · similarity 0.83)
- New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering (ICML 2024 · similarity 0.83)
- Competitively Consistent Clustering (ICML 2025 · similarity 0.82)
- Towards Better-than-2 Approximation for Constrained Correlation Clustering (ICML 2025 · similarity 0.82)
- Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants (AAAI 2025 · 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.
