Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| K-means Shlukování× | Variační autoenkodér× | |
|---|---|---|
| Obor≠ | Strojové učení | Hluboké učení |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 1967 (formalized 1982) | 2014 |
| Tvůrce≠ | MacQueen, J. B.; Lloyd, S. P. | Kingma, D. P. & Welling, M. |
| Typ≠ | Partitional clustering | Deep generative latent-variable model (encoder–decoder) |
| Původní zdroj≠ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗ | Kingma, D. P. & Welling, M. (2014). Auto-Encoding Variational Bayes. International Conference on Learning Representations (ICLR). link ↗ |
| Další názvy | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means | Değişkensel Otokodlayıcı (VAE), VAE, auto-encoding variational Bayes, deep latent variable model |
| Příbuzné≠ | 4 | 5 |
| Shrnutí≠ | 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. | The Variational Autoencoder (VAE) is a deep generative latent-variable model, introduced by Diederik Kingma and Max Welling in 2014, that encodes data as a probability distribution in a latent space and samples from that distribution to generate new examples. It is used for data generation, anomaly detection, and feature learning. |
| ScholarGateDatová sada ↗ |
|
|