Порівняння методів

	UMAP	Кластеризація методом k-середніх
Галузь	Машинне навчання	Машинне навчання
Родина	Machine learning	Machine learning
Рік появи	2018	1967 (formalized 1982)
Автор методу	McInnes, L.; Healy, J.; Melville, J.	MacQueen, J. B.; Lloyd, S. P.
Тип	Nonlinear manifold-learning dimension reduction	Partitional clustering
Основоположне джерело	McInnes, L., Healy, J. & Melville, J. (2018). UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction. arXiv:1802.03426.	Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137.
Інші назви	UMAP (Uniform Manifold Approximation and Projection), uniform manifold approximation and projection, manifold dimension reduction	k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Пов'язані	5	4
Підсумок	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.	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.