ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

UMAP×K-means-klustring×Analys av huvudkomponenter×
ÄmnesområdeMaskininlärningMaskininlärningMaskininlärning
FamiljMachine learningMachine learningMachine learning
Ursprungsår20181967 (formalized 1982)2002
UpphovspersonMcInnes, L.; Healy, J.; Melville, J.MacQueen, J. B.; Lloyd, S. P.Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
TypNonlinear manifold-learning dimension reductionPartitional clusteringUnsupervised dimensionality reduction
UrsprungskällaMcInnes, L., Healy, J. & Melville, J. (2018). UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction. arXiv:1802.03426. link ↗Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗
AliasUMAP (Uniform Manifold Approximation and Projection), uniform manifold approximation and projection, manifold dimension reductionk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-meansTemel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
Närliggande543
SammanfattningUMAP (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.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.
ScholarGateDatamängd
  1. v1
  2. 1 Källor
  3. PUBLISHED
  1. v1
  2. 2 Källor
  3. PUBLISHED
  1. v1
  2. 1 Källor
  3. PUBLISHED

Gå till sökningen Ladda ner bildspel

ScholarGateJämför metoder: UMAP · K-means · Principal Component Analysis. Hämtad 2026-06-19 från https://scholargate.app/sv/compare