Research map / Learning theory and algorithms / Clustering
Border-Peeling Clustering
Hadar Averbuch‐Elor, Nadav Bar, Daniel Cohen‐Or
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 |
|---|---|---|---|
| Border-Peeling instead of DBSCAN | BP · MNIST CNN features sample r=150 | ARI: 0.409 -> 0.927 | Improved |
| Border-Peeling instead of DBSCAN | BP · USPS (unsupervised features) | ARI: 0.000 -> 0.672 | Improved |
| Border-Peeling instead of HDBSCAN | BP · MNIST CNN features sample r=150 | ARI: 0.656 -> 0.927 | Improved |
| Border-Peeling instead of RCC at larger radius | BP · MNIST CNN features sample r=140 | ARI: 0.796 -> 0.928 | Improved |
| Border-Peeling instead of RCC at small radius | BP · MNIST CNN features sample r=120 | ARI: 0.976 -> 0.932 | Hurt |
| Border-Peeling instead of RCC on USPS | BP · USPS (unsupervised features) | ARI: 0.749 -> 0.672 | Hurt |
| Border-Peeling instead of HDBSCAN on YTF | BP · YTF (unsupervised features) | ARI: 0.657 -> 0.252 | Hurt |
| Border-Peeling instead of Affinity Propagation limits over-segmentation | BP · MNIST CNN features sample r=150 | Det# clusters: 110.9 -> 10.6 | Improved |
| Border-Peeling instead of Mean-Shift on large datasets | BP · USPS (unsupervised features) | Det# clusters: 8315 -> 19 | Improved |
| Border-Peeling instead of K-Means on synthetic A | BP · Synthetic A (2 classes) | ARI: 0.453 -> 0.983 | Improved |
| Border-Peeling instead of QCC on synthetic A | BP · Synthetic A (2 classes) | AMI: 0.897 -> 0.962 | Improved |
| Border-Peeling instead of RCC on runtime | BP · YTF | runtime: 36 -> 71 seconds | Hurt |
Closest papers by meaning
- Samples Are Not Equal: A Sample Selection Approach for Deep Clustering (ICLR 2026 · similarity 0.87)
- DeepDPM: Deep Clustering With an Unknown Number of Clusters (CVPR 2022 · similarity 0.86)
- Non-Graph Data Clustering via $\mathcal {O}(n)$ Bipartite Graph Convolution (TPAMI 2022 · similarity 0.86)
- You Can Trust Your Clustering Model: A Parameter-free Self-Boosting Plug-in for Deep Clustering (NeurIPS 2025 · similarity 0.85)
- Breaking the Reclustering Barrier in Centroid-based Deep Clustering (ICLR 2025 · similarity 0.84)
- Bifurcate then Alienate: Incomplete Multi-view Clustering via Coupled Distribution Learning with Linear Overhead (ICML 2025 · similarity 0.84)
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.
