Sign inGet started
Paper · arXiv

AdaBox: Adaptive Density-Based Box Clustering with Parameter Generalization

Density-based clustering algorithms like DBSCAN and HDBSCAN are foundational tools for discovering arbitrarily shaped clusters, yet their practical utility is undermined by acute hyperparameter sensitivity -- parameters tuned on one dataset frequently fail to transfer to others, requiring expensive re-optimization for each deployment. We introduce AdaBox (Adaptive Density-Based Box Clustering), a grid-based density clustering algorithm designed for robustness across diverse data geometries. AdaBox features a six-parameter design where parameters capture cluster structure rather than pairwise point relationships. Four parameters are inherently scale-invariant, one self-corrects for samplin...

AuthorsAhmed Elmahdi
Primary categorycs.LG
Published6 March 2026
Last updated at source6 March 2026
cs.LGcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/f203f598-d990-44a3-b422-9e2edb7af1bd" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.