Bandingkan metode
Tinjau metode pilihan Anda berdampingan; baris yang berbeda akan disorot.
| Autoenkoder× | Clustering K-means× | Analisis Komponen Utama× | |
|---|---|---|---|
| Bidang≠ | Pembelajaran Mendalam | Pembelajaran Mesin | Pembelajaran Mesin |
| Keluarga | Machine learning | Machine learning | Machine learning |
| Tahun asal≠ | 2006 | 1967 (formalized 1982) | 2002 |
| Pencetus≠ | Hinton, G.E. & Salakhutdinov, R.R. | MacQueen, J. B.; Lloyd, S. P. | Jolliffe, I.T. (textbook); Pearson & Hotelling (origins) |
| Tipe≠ | Neural network (encoder-decoder) | Partitional clustering | Unsupervised dimensionality reduction |
| Sumber perintis≠ | 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 ↗ |
| Alias | Otokodlayıcı (Autoencoder), otokodlayıcı, auto-encoder, encoder-decoder network | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means | Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform |
| Terkait≠ | 4 | 4 | 3 |
| Ringkasan≠ | An 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 data ↗ |
|
|
|