So sánh phương pháp

	Online DBSCAN	HDBSCAN	K-means Trực tuyến
Lĩnh vực	Học máy	Học máy	Học máy
Họ	Machine learning	Machine learning	Machine learning
Năm ra đời	1998	2013	1967 (online update rule); 2010 (mini-batch variant)
Người khởi xướng	Ester, M., Kriegel, H.-P., Sander, J., Wimmer, M., & Xu, X.	Campello, R. J. G. B.; Moulavi, D.; Sander, J.	MacQueen, J. (batch); Sculley, D. (mini-batch web-scale variant)
Loại	Incremental density-based clustering	Hierarchical density-based clustering	Unsupervised clustering (online/streaming)
Công trình gốc	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.	MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1, pp. 281–297. University of California Press.
Tên gọi khác	Incremental DBSCAN, Streaming DBSCAN, Online density-based clustering, iDBSCAN	HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN*	sequential k-means, streaming k-means, incremental k-means, online clustering
Liên quan	5	3	4
Tóm tắt	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.	Online K-means is a streaming variant of the classical K-means algorithm that updates cluster centroids one observation at a time — or in small mini-batches — without storing the entire dataset in memory. It is particularly suited to large-scale, real-time, or continuously arriving data where batch recomputation would be too slow or impractical.