ScholarGate
Assistent

Võrdle meetodeid

Vaata valitud meetodeid kõrvuti; erinevad read on esile tõstetud.

UMAP×K-keskmiste klasterdamine×Pricipaalanalüüs×
ValdkondMasinõpeMasinõpeMasinõpe
PerekondMachine learningMachine learningMachine learning
Tekkeaasta20181967 (formalized 1982)2002
LoojaMcInnes, L.; Healy, J.; Melville, J.MacQueen, J. B.; Lloyd, S. P.Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
TüüpNonlinear manifold-learning dimension reductionPartitional clusteringUnsupervised dimensionality reduction
AlgallikasMcInnes, 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 ↗
RööpnimetusedUMAP (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
Seotud543
KokkuvõteUMAP (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.
ScholarGateAndmestik
  1. v1
  2. 1 Allikad
  3. PUBLISHED
  1. v1
  2. 2 Allikad
  3. PUBLISHED
  1. v1
  2. 1 Allikad
  3. PUBLISHED

Mine otsingusse Laadi slaidid alla

ScholarGateVõrdle meetodeid: UMAP · K-means · Principal Component Analysis. Loetud 2026-06-19 aadressilt https://scholargate.app/et/compare