Uporedite metode

	K-means algoritam klasterovanja	DBSCAN	Analiza glavnih komponenti	t-SNE
Oblast	Mašinsko učenje	Mašinsko učenje	Mašinsko učenje	Mašinsko učenje
Porodica	Machine learning	Machine learning	Machine learning	Machine learning
Godina nastanka	1967 (formalized 1982)	1996	2002	2008
Tvorac	MacQueen, J. B.; Lloyd, S. P.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.	Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)	van der Maaten, L. & Hinton, G.
Tip	Partitional clustering	Density-based clustering algorithm	Unsupervised dimensionality reduction	Nonlinear dimensionality reduction (manifold visualization)
Temeljni izvor	Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137.	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.	Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer.	van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605.
Drugi nazivi	k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering	Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform	t-SNE (Boyut İndirgeme / Görselleştirme), t-distributed stochastic neighbor embedding, tsne
Srodne	4	3	3	3
Sažetak	K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis.	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.	Principal Component Analysis (PCA) is an unsupervised dimensionality-reduction method — given its modern textbook treatment by Ian Jolliffe (2002) — that compresses high-dimensional data into fewer dimensions while preserving the maximum possible variance. It re-expresses correlated variables as a small set of uncorrelated principal components ordered by how much of the data's variation each one captures.	t-SNE (t-Distributed Stochastic Neighbor Embedding) is a nonlinear dimensionality-reduction method introduced by Laurens van der Maaten and Geoffrey Hinton in 2008 that maps high-dimensional data into a 2D or 3D space for visualization. It preserves probabilistic local similarities, so points that are neighbours in the original space stay close together, revealing cluster structure and local neighbourhoods.