ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Autoencoder×Clustering K-means×Analiza Componentelor Principale×
DomeniuÎnvățare profundăÎnvățare automatăÎnvățare automată
FamilieMachine learningMachine learningMachine learning
Anul apariției20061967 (formalized 1982)2002
Autorul originalHinton, G.E. & Salakhutdinov, R.R.MacQueen, J. B.; Lloyd, S. P.Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
TipNeural network (encoder-decoder)Partitional clusteringUnsupervised dimensionality reduction
Sursa seminalăHinton, G.E. & Salakhutdinov, R.R. (2006). Reducing the Dimensionality of Data with Neural Networks. Science, 313(5786), 504–507. DOI ↗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 ↗
Denumiri alternativeOtokodlayıcı (Autoencoder), otokodlayıcı, auto-encoder, encoder-decoder networkk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-meansTemel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
Înrudite443
RezumatAn autoencoder is an encoder-decoder neural network, popularised by Hinton and Salakhutdinov in 2006, that compresses data into a low-dimensional latent code and then reconstructs it, enabling dimensionality reduction and anomaly detection. By learning to rebuild its own input through a narrow bottleneck, it discovers a compact representation of the data.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.
ScholarGateSet de date
  1. v1
  2. 1 Surse
  3. PUBLISHED
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 1 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Autoencoder · K-means · Principal Component Analysis. Preluat la 2026-06-17 de pe https://scholargate.app/ro/compare