পদ্ধতির তুলনা করুন

	অনলাইন HDBSCAN	HDBSCAN
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2015–2017	2013
প্রবর্তক	Campello, R. J. G. B. et al. (base); incremental extensions by Hassani, M. et al.	Campello, R. J. G. B.; Moulavi, D.; Sander, J.
ধরন	Incremental hierarchical density-based clustering	Hierarchical density-based clustering
মৌলিক উৎস	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.	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.
অপর নাম	incremental HDBSCAN, streaming HDBSCAN, online hierarchical density clustering, dynamic HDBSCAN	HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*
সম্পর্কিত	6	3
সারসংক্ষেপ	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.	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.