AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Bagged k-Distance for Mode-Based Clustering Using the Probability of Localized Level Sets

Hanyuan Hang

JMLR 2025 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms

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 bagging (BDMBC) to DMBC (ablation)DMBC · GisetteARI: 0.6250 -> 0.6482Improved
add bagging (BDMBC) to DMBC (ablation)DMBC · COILARI: 0.8628 -> 0.8865Improved
add bagging (BDMBC) to DMBC (ablation)DMBC · HTRU2ARI: 0.8151 -> 0.8327Improved
add bagging (BDMBC) to DMBC (ablation)DMBC · WineARI: 0.9133 -> 0.9133No clear effect
add bagging (BDMBC) to DMBC (ablation)DMBC · USPSARI: 0.8671 -> 0.8672No clear effect
add bagging with sampling ratio 0.1 to DMBC (ablation)DMBC · 3Clusters (synthetic)optimal k_D: 23 -> 3Improved
add bagging with sampling ratio 0.1 to DMBC (ablation)DMBC · Circles (synthetic)optimal k_D: 17 -> 7Improved
add bagging with sampling ratio 0.1 to DMBC (ablation)DMBC · Moons (synthetic)optimal k_D: 11 -> 2Improved
use probability of localized level sets (global threshold) instead of density thresholdBDMBC · three-Gaussian syntheticARI: best ARI reaches 0.99Improved

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