ScholarGate
Asistenti

Krahasoni metodat

Shqyrtoni metodat e zgjedhura krah për krah; rreshtat që ndryshojnë janë të theksuar.

UMAP×Grupimi K-mesisht×
FushaMësimi i makinësMësimi i makinës
FamiljaMachine learningMachine learning
Viti i origjinës20181967 (formalized 1982)
KrijuesiMcInnes, L.; Healy, J.; Melville, J.MacQueen, J. B.; Lloyd, S. P.
LlojiNonlinear manifold-learning dimension reductionPartitional clustering
Burimi themeluesMcInnes, 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 ↗
Emërtime të tjeraUMAP (Uniform Manifold Approximation and Projection), uniform manifold approximation and projection, manifold dimension reductionk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Të lidhura54
PërmbledhjaUMAP (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.
ScholarGateSeti i të dhënave
  1. v1
  2. 1 Burimet
  3. PUBLISHED
  1. v1
  2. 2 Burimet
  3. PUBLISHED

Shko te kërkimi Shkarko diapozitivat

ScholarGateKrahasoni metodat: UMAP · K-means. Marrë më 2026-06-18 nga https://scholargate.app/sq/compare