Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Автокодувальник× | Кластеризація методом k-середніх× | |
|---|---|---|
| Галузь≠ | Глибоке навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2006 | 1967 (formalized 1982) |
| Автор методу≠ | Hinton, G.E. & Salakhutdinov, R.R. | MacQueen, J. B.; Lloyd, S. P. |
| Тип≠ | Neural network (encoder-decoder) | Partitional clustering |
| Основоположне джерело≠ | 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 ↗ |
| Інші назви | Otokodlayıcı (Autoencoder), otokodlayıcı, auto-encoder, encoder-decoder network | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means |
| Пов'язані | 4 | 4 |
| Підсумок≠ | 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. |
| ScholarGateНабір даних ↗ |
|
|