Research map / Learning theory and algorithms / Clustering
Bagged k-Distance for Mode-Based Clustering Using the Probability of Localized Level Sets
Hanyuan Hang
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 bagging (BDMBC) to DMBC (ablation) | DMBC · Gisette | ARI: 0.6250 -> 0.6482 | Improved |
| add bagging (BDMBC) to DMBC (ablation) | DMBC · COIL | ARI: 0.8628 -> 0.8865 | Improved |
| add bagging (BDMBC) to DMBC (ablation) | DMBC · HTRU2 | ARI: 0.8151 -> 0.8327 | Improved |
| add bagging (BDMBC) to DMBC (ablation) | DMBC · Wine | ARI: 0.9133 -> 0.9133 | No clear effect |
| add bagging (BDMBC) to DMBC (ablation) | DMBC · USPS | ARI: 0.8671 -> 0.8672 | No clear effect |
| add bagging with sampling ratio 0.1 to DMBC (ablation) | DMBC · 3Clusters (synthetic) | optimal k_D: 23 -> 3 | Improved |
| add bagging with sampling ratio 0.1 to DMBC (ablation) | DMBC · Circles (synthetic) | optimal k_D: 17 -> 7 | Improved |
| add bagging with sampling ratio 0.1 to DMBC (ablation) | DMBC · Moons (synthetic) | optimal k_D: 11 -> 2 | Improved |
| use probability of localized level sets (global threshold) instead of density threshold | BDMBC · three-Gaussian synthetic | ARI: best ARI reaches 0.99 | Improved |
Closest papers by meaning
- Scalable Laplacian K-modes (NeurIPS 2018 · similarity 0.87)
- TANGO: Clustering with Typicality-Aware Nonlocal Mode-Seeking and Graph-Cut Optimization (ICML 2025 · similarity 0.86)
- Graph-based Clustering Revisited: A Relaxation of Kernel k-Means Perspective (JMLR 2026 · similarity 0.85)
- Hierarchical Clustering Beyond the Worst-Case (NeurIPS 2017 · similarity 0.85)
- Generalization Performance of Ensemble Clustering: From Theory to Algorithm (ICML 2025 · similarity 0.84)
- Average Sensitivity of Hierarchical $k$-Median Clustering (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.
