Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Графовая сеть внимания (Graph Attention Network, GAT)× | Рекуррентная нейронная сеть× | XGBoost× | |
|---|---|---|---|
| Область≠ | Глубокое обучение | Глубокое обучение | Машинное обучение |
| Семейство | Machine learning | Machine learning | Machine learning |
| Год появления≠ | 2018 | 1986–1990 | 2016 |
| Автор метода≠ | Veličković, P. et al. | Rumelhart, D. E.; Elman, J. L. | Chen, T. & Guestrin, C. |
| Тип≠ | Graph neural network (attention-based) | Sequential neural network | Ensemble (gradient-boosted decision trees) |
| Основополагающий источник≠ | Veličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗ | Elman, J. L. (1990). Finding structure in time. Cognitive Science, 14(2), 179–211. DOI ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| Другие названия≠ | Graf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural network | RNN, Elman network, Jordan network, simple recurrent network | XGBoost, extreme gradient boosting, scalable tree boosting |
| Связанные≠ | 4 | 3 | 5 |
| Сводка≠ | The Graph Attention Network (GAT), introduced by Veličković and colleagues in 2018, is a graph neural network variant that learns how much importance to assign to each neighbouring node through a self-attention mechanism. On heterogeneous neighbourhoods and relational classification it produces results superior to graph convolutional networks (GCN). | A Recurrent Neural Network (RNN) is a class of neural network designed to process sequential data by maintaining a hidden state that carries information across time steps. Introduced in its modern form by Rumelhart et al. (1986) and further shaped by Elman (1990), RNNs became the dominant architecture for sequence modelling in NLP, speech, and time-series analysis before the rise of attention-based models. | 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. |
| ScholarGateНабор данных ↗ |
|
|
|