Compară metode

	DBSCAN	Clustering Ierarhic	UMAP
Domeniu	Învățare automată	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning	Machine learning
Anul apariției	1996	1963	2018
Autorul original	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.	Ward, J. H.	McInnes, L.; Healy, J.; Melville, J.
Tip	Density-based clustering algorithm	Unsupervised clustering (agglomerative)	Nonlinear manifold-learning dimension reduction
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.	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.	McInnes, L., Healy, J. & Melville, J. (2018). UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction. arXiv:1802.03426.
Denumiri alternative	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering	UMAP (Uniform Manifold Approximation and Projection), uniform manifold approximation and projection, manifold dimension reduction
Înrudite	3	4	5
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.	Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963.	UMAP (Uniform Manifold Approximation and Projection) is a fast, scalable nonlinear dimension-reduction method grounded in manifold-learning theory, introduced by McInnes, Healy and Melville in 2018. It compresses high-dimensional data into a low-dimensional embedding for visualisation and downstream analysis.