ScholarGate
Msaidizi

Linganisha mbinu

Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.

UMAP×Uainishaji wa K-means×
NyanjaUjifunzaji wa MashineUjifunzaji wa Mashine
FamiliaMachine learningMachine learning
Mwaka wa asili20181967 (formalized 1982)
MwanzilishiMcInnes, L.; Healy, J.; Melville, J.MacQueen, J. B.; Lloyd, S. P.
AinaNonlinear manifold-learning dimension reductionPartitional clustering
Chanzo asiliaMcInnes, 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 ↗
Majina mbadalaUMAP (Uniform Manifold Approximation and Projection), uniform manifold approximation and projection, manifold dimension reductionk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Zinazohusiana54
MuhtasariUMAP (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 ya data
  1. v1
  2. 1 Vyanzo
  3. PUBLISHED
  1. v1
  2. 2 Vyanzo
  3. PUBLISHED

Nenda kwenye utafutaji Pakua slaidi

ScholarGateLinganisha mbinu: UMAP · K-means. Imepatikana 2026-06-18 kutoka https://scholargate.app/sw/compare