Compara mètodes
Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.
| Autoencoder× | Random Forest× | Transformer (NLP)× | |
|---|---|---|---|
| Camp≠ | Aprenentatge profund | Aprenentatge automàtic | Aprenentatge profund |
| Família | Machine learning | Machine learning | Machine learning |
| Any d'origen≠ | 2006 | 2001 | 2017 |
| Autor original≠ | Hinton, G.E. & Salakhutdinov, R.R. | Breiman, L. | Vaswani, A. et al. |
| Tipus≠ | Neural network (encoder-decoder) | Ensemble (bagging of decision trees) | Attention-based deep neural network |
| Font seminal≠ | Hinton, G.E. & Salakhutdinov, R.R. (2006). Reducing the Dimensionality of Data with Neural Networks. Science, 313(5786), 504–507. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Vaswani, A. et al. (2017). Attention Is All You Need. NeurIPS. link ↗ |
| Àlies | Otokodlayıcı (Autoencoder), otokodlayıcı, auto-encoder, encoder-decoder network | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | Transformer Modeli (NLP), attention-based language model, self-attention network, transformer NLP |
| Relacionats | 4 | 4 | 4 |
| Resum≠ | 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. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. | The Transformer is an attention-based deep learning model, introduced by Vaswani and colleagues in 2017, that performs text classification, named-entity recognition, and language modelling by letting every token in a sequence attend directly to every other token. It replaced earlier recurrent designs with a self-attention mechanism that processes whole sequences in parallel. |
| ScholarGateConjunt de dades ↗ |
|
|
|