ScholarGate
सहायक

विधियों की तुलना करें

चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।

UMAP×के-मीन्स क्लस्टरिंग×प्रिंसिपल कंपोनेंट एनालिसिस×
क्षेत्रमशीन अधिगममशीन अधिगममशीन अधिगम
परिवारMachine learningMachine learningMachine learning
उद्भव वर्ष20181967 (formalized 1982)2002
प्रवर्तकMcInnes, L.; Healy, J.; Melville, J.MacQueen, J. B.; Lloyd, S. P.Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
प्रकारNonlinear manifold-learning dimension reductionPartitional clusteringUnsupervised dimensionality reduction
मौलिक स्रोतMcInnes, 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 ↗
उपनामUMAP (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
संबंधित543
सारांश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.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.
ScholarGateडेटासेट
  1. v1
  2. 1 स्रोत
  3. PUBLISHED
  1. v1
  2. 2 स्रोत
  3. PUBLISHED
  1. v1
  2. 1 स्रोत
  3. PUBLISHED

खोज पर जाएँ स्लाइड डाउनलोड करें

ScholarGateविधियों की तुलना करें: UMAP · K-means · Principal Component Analysis. 2026-06-19 को यहाँ से प्राप्त https://scholargate.app/hi/compare