방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 그래프 어텐션 네트워크× | 랜덤 포레스트× | |
|---|---|---|
| 분야≠ | 딥러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2018 | 2001 |
| 창시자≠ | Veličković, P. et al. | Breiman, L. |
| 유형≠ | Graph neural network (attention-based) | Ensemble (bagging of decision trees) |
| 원전≠ | Veličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 별칭 | 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 |
| 관련 | 4 | 4 |
| 요약≠ | 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. |
| ScholarGate데이터셋 ↗ |
|
|