FISHDBC: Flexible, Incremental, Scalable, Hierarchical Density-Based Clustering for Arbitrary Data and Distance
Not on the map. Why?
Abstract (arXiv)
FISHDBC is a flexible, incremental, scalable, and hierarchical density-based clustering algorithm. It is flexible because it empowers users to work on arbitrary data, skipping the feature extraction step that usually transforms raw data in numeric arrays letting users define an arbitrary distance function instead. It is incremental and scalable: it avoids the mathcal O(n2) performance of other approaches in non-metric spaces and requires only lightweight computation to update the clustering when few items are added. It is hierarchical: it produces a "flat" clustering which can be expanded to a tree structure, so that users can group and/or divide clusters in sub- or super-clusters when data exploration requires so. It is density-based and approximates HDBSCAN*, an evolution of DBSCAN.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 3; 2025: 1.
4 papers.
- 2024Carbon Filter: Real-time Alert Triage Using Large Scale Clustering and Fast Searchcited by 0
- 2024Sonic: Fast and Transferable Data Poisoning on Clustering Algorithmscited by 0
- 2024Dynamic data summarization for hierarchical spatial clusteringcited by 0
- 2025FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Datacited by 0
- 2025FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data18 Jul 2025
- 2024Dynamic data summarization for hierarchical spatial clustering26 Nov 2024
- 2024Sonic: Fast and Transferable Data Poisoning on Clustering Algorithms14 Aug 2024
- 2024Carbon Filter: Real-time Alert Triage Using Large Scale Clustering and Fast Search7 May 2024