Research map / Learning theory and algorithms / Clustering
Graph-based Clustering Revisited: A Relaxation of Kernel k-Means Perspective
Wenlong Lyu, Yuheng Jia, Hui Liu, Junhui Hou
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 block diagonal regularization (B-LoRD over LoRD) (ablation) | LoRD · Average ACC over 9 datasets | ACC: 0.636 -> 0.720 | Improved |
| use B-LoRD instead of second-best SDS | SDS · Average ACC over 9 datasets | ACC: 0.667 -> 0.720 | Improved |
| use adaptive tau-hat-1 instead of tuned tau (ablation) | B-LoRD · Average ACC over 12 datasets | ACC: 0.720 -> 0.670 | Hurt |
| use adaptive tau-hat-2 instead of tuned tau (ablation) | B-LoRD · Average ACC over 12 datasets | ACC: 0.720 -> 0.675 | Hurt |
| use true class prior mu* instead of uniform mu0 (ablation) | LoRD · Ecoli | ACC: 0.455 -> 0.717 | Improved |
| use true class prior mu* instead of uniform mu0 (ablation) | B-LoRD · Ecoli | ACC: 0.741 -> 0.801 | Improved |
| use true class prior mu* instead of uniform mu0 (ablation) | LoRD · Yeast | ACC: 0.303 -> 0.385 | Improved |
| use true class prior mu* instead of uniform mu0 (ablation) | LoRD · Wine | ACC: 0.944 -> 0.916 | Hurt |
| use true class prior mu* instead of uniform mu0 (ablation) | B-LoRD · MNIST-2000 | ACC: 0.745 -> 0.742 | No clear effect |
| use true class prior mu* instead of uniform mu0 (ablation) | LoRD · Synthetic Gaussians IBR 0.1761 | ACC: 0.620 -> 0.885 | Improved |
| add block diagonal regularization (B-LoRD over LoRD), uniform prior (ablation) | LoRD · Synthetic Gaussians IBR 0.1761 (mu0) | ACC: 0.620 -> 0.700 | Improved |
| replace Dykstra-based initialization with Sinkhorn-Knopp (ablation) | LoRD and B-LoRD · initialization of V | clustering quality | Improved |
Closest papers by meaning
- Hierarchical Clustering Beyond the Worst-Case (NeurIPS 2017 · similarity 0.91)
- The Constrained Laplacian Rank Algorithm for Graph-Based Clustering (AAAI 2016 · similarity 0.91)
- Hierarchical Clustering: $O(1)$-Approximation for Well-Clustered Graphs (NeurIPS 2021 · similarity 0.91)
- Efficient Clustering Based On A Unified View Of $K$-means And Ratio-cut (NeurIPS 2020 · similarity 0.91)
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting (JMLR 2019 · similarity 0.90)
- Optimal Graph Clustering without Edge Density Signals (NeurIPS 2025 · similarity 0.90)
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.
