Comparer des méthodes

	HDBSCAN en ligne	DBSCAN
Domaine	Apprentissage automatique	Apprentissage automatique
Famille	Machine learning	Machine learning
Année d'origine	2015–2017	1996
Auteur d'origine	Campello, R. J. G. B. et al. (base); incremental extensions by Hassani, M. et al.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.
Type	Incremental hierarchical density-based clustering	Density-based clustering algorithm
Source fondatrice	Hassani, M., Seidl, T. (2017). Using internal evaluation measures to validate the quality of diverse stream clustering algorithms. Vietnam Journal of Computer Science, 4(3), 171–183.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231.
Alias	incremental HDBSCAN, streaming HDBSCAN, online hierarchical density clustering, dynamic HDBSCAN	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering
Apparentées	6	3
Résumé	Online HDBSCAN extends the HDBSCAN hierarchical density-based clustering algorithm to incrementally process streaming or sequentially arriving data. Rather than rebuilding the full hierarchy from scratch with each new observation, it maintains and locally updates the mutual reachability graph, minimum spanning tree, condensed cluster tree, and stability-based cluster extraction, enabling continuous density-based clustering without full-dataset reprocessing.	DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.