arXiv Analytics

Sign in

arXiv:2311.15887 [cs.LG]AbstractReferencesReviewsResources

FLASC: A Flare-Sensitive Clustering Algorithm: Extending HDBSCAN* for Detecting Branches in Clusters

D. M. Bot, J. Peeters, J. Liesenborgs, J. Aerts

Published 2023-11-27Version 1

We present FLASC, an algorithm for flare-sensitive clustering. Our algorithm builds upon HDBSCAN* -- which provides high-quality density-based clustering performance -- through a post-processing step that differentiates branches within the detected clusters' manifold, adding a type of pattern that can be discovered. Two variants of the algorithm are presented, which trade computational cost for noise robustness. We show that both variants scale similarly to HDBSCAN* in terms of computational cost and provide stable outputs using synthetic data sets, resulting in an efficient flare-sensitive clustering algorithm. In addition, we demonstrate the algorithm's benefit in data exploration over HDBSCAN* clustering on two real-world data sets.

Comments: 20 pages, 11 figures, submitted to ACM TKDD
Categories: cs.LG, cs.DB
Subjects: I.5.3, H.3.3
Related articles: Most relevant | Search more
arXiv:1203.3475 [cs.LG] (Published 2012-03-15)
Inferring deterministic causal relations
arXiv:2102.07835 [cs.LG] (Published 2021-02-15)
Topological Graph Neural Networks
arXiv:1911.06965 [cs.LG] (Published 2019-11-16)
An "outside the box" solution for imbalanced data classification