Compară metode

	DBSCAN	Învățare online
Domeniu	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning
Anul apariției	1996	1958–2000s
Autorul original	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.	Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)
Tip	Density-based clustering algorithm	Learning paradigm (sequential model update)
Sursa seminală	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.	Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194.
Denumiri alternative	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering	incremental learning, sequential learning, streaming learning, online machine learning
Înrudite	3	6
Rezumat	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.	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.