Jämför metoder

	Online DBSCAN	HDBSCAN
Ämnesområde	Maskininlärning	Maskininlärning
Familj	Machine learning	Machine learning
Ursprungsår	1998	2013
Upphovsperson	Ester, M., Kriegel, H.-P., Sander, J., Wimmer, M., & Xu, X.	Campello, R. J. G. B.; Moulavi, D.; Sander, J.
Typ	Incremental density-based clustering	Hierarchical density-based clustering
Ursprungskälla	Ester, M., Kriegel, H.-P., Sander, J., Wimmer, M., & Xu, X. (1998). Incremental Clustering for Mining in a Data Warehousing Environment. In Proceedings of the 24th International Conference on Very Large Data Bases (VLDB), pp. 323–333.	Campello, R. J. G. B., Moulavi, D., & Sander, J. (2013). Density-Based Clustering Based on Hierarchical Density Estimates. In J. Pei et al. (Eds.), Advances in Knowledge Discovery and Data Mining. PAKDD 2013. Lecture Notes in Computer Science, vol. 7819 (pp. 160–172). Springer, Berlin, Heidelberg.
Alias	Incremental DBSCAN, Streaming DBSCAN, Online density-based clustering, iDBSCAN	HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*
Närliggande	5	3
Sammanfattning	Online DBSCAN extends the classic density-based clustering algorithm to handle continuously arriving data points without re-clustering the entire dataset from scratch. Each new observation is integrated into the existing cluster structure by local neighborhood queries, making it practical for streaming and data-warehousing scenarios where data grows incrementally.	HDBSCAN (Hierarchical Density-Based Spatial Clustering of Applications with Noise) is a density-based clustering algorithm introduced by Campello, Moulavi, and Sander in 2013. It extends DBSCAN by building a full hierarchy of density-based clusters across all density scales and then extracting a stable flat partition, making it robust to datasets where cluster densities vary substantially across regions.