ScholarGate
Asystent

Porównaj metody

Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.

Sieci konwolucyjne grafów (GCN)×Sieć uwagi grafowej×
DziedzinaUczenie głębokieUczenie głębokie
RodzinaMachine learningMachine learning
Rok powstania20172018
TwórcaKipf, T. N. & Welling, M.Veličković, P. et al.
TypSpectral graph neural network (semi-supervised node classification)Graph neural network (attention-based)
Źródło pierwotneKipf, T. N., & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. Proceedings of the 5th International Conference on Learning Representations (ICLR 2017), Toulon, France. link ↗Veličković, P. et al. (2018). Graph Attention Networks. ICLR. link ↗
Inne nazwyGCN, graph convolutional network, spectral graph convolution, Kipf-Welling GCNGraf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural network
Pokrewne14
PodsumowanieGraph Convolutional Network (GCN) is a foundational deep learning architecture for graph-structured data, introduced by Thomas N. Kipf and Max Welling at ICLR 2017. It extends the convolution operation to irregular graph domains via a first-order spectral approximation, enabling each node to aggregate feature information from its neighbors. The model became the canonical baseline for semi-supervised node classification and sparked the modern graph neural network research agenda.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).
ScholarGateZbiór danych
  1. v1
  2. 2 Źródła
  3. PUBLISHED
  1. v1
  2. 2 Źródła
  3. PUBLISHED

Przejdź do wyszukiwania Pobierz slajdy

ScholarGatePorównaj metody: Graph Convolutional Network · Graph Attention Network. Pobrano 2026-06-15 z https://scholargate.app/pl/compare