手法を比較

	DBSCAN	HDBSCAN	オンライン学習
分野	機械学習	機械学習	機械学習
系統	Machine learning	Machine learning	Machine learning
提唱年	1996	2013	1958–2000s
提唱者	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.	Campello, R. J. G. B.; Moulavi, D.; Sander, J.	Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)
種類	Density-based clustering algorithm	Hierarchical density-based clustering	Learning paradigm (sequential model update)
原典	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.	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.	Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194.
別名	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering	HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*	incremental learning, sequential learning, streaming learning, online machine learning
関連	3	3	6
概要	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.	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.	Online learning is a machine learning paradigm in which a model is updated incrementally as each new data point arrives, rather than being trained once on a fixed dataset. It is essential when data streams continuously, storage is limited, or the underlying distribution shifts over time. Theoretical performance is measured by cumulative regret relative to the best fixed predictor in hindsight.