ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

Réseau d'attention sur graphe×XGBoost×
DomaineApprentissage profondApprentissage automatique
FamilleMachine learningMachine learning
Année d'origine20182016
Auteur d'origineVeličković, P. et al.Chen, T. & Guestrin, C.
TypeGraph neural network (attention-based)Ensemble (gradient-boosted decision trees)
Source fondatriceVeličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗
AliasGraf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural networkXGBoost, extreme gradient boosting, scalable tree boosting
Apparentées45
Résumé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).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.
ScholarGateJeu de données
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: Graph Attention Network · XGBoost. Consulté le 2026-06-17 sur https://scholargate.app/fr/compare