Módszerek összehasonlítása
Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.
| Transformer (NLP)× | Autoencoder× | XGBoost× | |
|---|---|---|---|
| Tudományterület≠ | Mélytanulás | Mélytanulás | Gépi tanulás |
| Módszercsalád | Machine learning | Machine learning | Machine learning |
| Keletkezés éve≠ | 2017 | 2006 | 2016 |
| Megalkotó≠ | Vaswani, A. et al. | Hinton, G.E. & Salakhutdinov, R.R. | Chen, T. & Guestrin, C. |
| Típus≠ | Attention-based deep neural network | Neural network (encoder-decoder) | Ensemble (gradient-boosted decision trees) |
| Alapmű≠ | Vaswani, A. et al. (2017). Attention Is All You Need. NeurIPS. link ↗ | Hinton, G.E. & Salakhutdinov, R.R. (2006). Reducing the Dimensionality of Data with Neural Networks. Science, 313(5786), 504–507. DOI ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| Alternatív nevek≠ | Transformer Modeli (NLP), attention-based language model, self-attention network, transformer NLP | Otokodlayıcı (Autoencoder), otokodlayıcı, auto-encoder, encoder-decoder network | XGBoost, extreme gradient boosting, scalable tree boosting |
| Kapcsolódó≠ | 4 | 4 | 5 |
| Összefoglaló≠ | 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. | 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. | XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions. |
| ScholarGateAdatkészlet ↗ |
|
|
|