So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Mạng Hồi quy Đồ thị (Graph Attention Network - GAT)× | Rừng ngẫu nhiên× | Mạng nơ-ron hồi quy× | XGBoost× | |
|---|---|---|---|---|
| Lĩnh vực≠ | Học sâu | Học máy | Học sâu | Học máy |
| Họ | Machine learning | Machine learning | Machine learning | Machine learning |
| Năm ra đời≠ | 2018 | 2001 | 1986–1990 | 2016 |
| Người khởi xướng≠ | Veličković, P. et al. | Breiman, L. | Rumelhart, D. E.; Elman, J. L. | Chen, T. & Guestrin, C. |
| Loại≠ | Graph neural network (attention-based) | Ensemble (bagging of decision trees) | Sequential neural network | Ensemble (gradient-boosted decision trees) |
| Công trình gốc≠ | Veličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | 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 ↗ |
| Tên gọi khác≠ | Graf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural network | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | RNN, Elman network, Jordan network, simple recurrent network | XGBoost, extreme gradient boosting, scalable tree boosting |
| Liên quan≠ | 4 | 4 | 3 | 5 |
| Tóm tắt≠ | 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). | 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. | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|
|
|