Сравнение методов
Просматривайте выбранные методы рядом; строки с различиями подсвечены.
| Semi-supervised Graph Neural Network× | Графовая нейронная сеть× | |
|---|---|---|
| Область≠ | Глубокое обучение | Сетевой анализ |
| Семейство≠ | Machine learning | Process / pipeline |
| Год появления≠ | 2017 (GCN formulation); 2004 (label propagation roots) | 2017–2018 (major variants) |
| Автор метода≠ | Kipf, T. N. & Welling, M. (canonical formulation); Zhou et al. (label propagation precursor) | — |
| Тип≠ | Semi-supervised graph representation learning | Deep learning on graph-structured data |
| Основополагающий источник≠ | Kipf, T. N., & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. International Conference on Learning Representations (ICLR 2017). link ↗ | Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. International Conference on Learning Representations (ICLR). DOI ↗ |
| Другие названия≠ | Semi-supervised GNN, GNN semi-supervised learning, graph-based semi-supervised classification, semi-supervised node classification | GNN, GCN, GAT, GraphSAGE |
| Связанные≠ | 4 | 5 |
| Сводка≠ | A semi-supervised graph neural network trains a GNN on a graph where only a small fraction of nodes carry labels, using neighborhood message-passing to spread information from labeled nodes to unlabeled ones. The approach, popularised by Kipf and Welling's 2017 Graph Convolutional Network, achieves strong node-classification accuracy even when labeled examples are scarce. | A Graph Neural Network (GNN) is a deep learning architecture that operates directly on graph-structured data by combining node features with structural information through iterative neighborhood message passing. The three canonical variants — the Graph Convolutional Network (GCN) introduced by Kipf and Welling in 2017, the Graph Attention Network (GAT) introduced by Veličković et al. in 2018, and GraphSAGE — differ in how they aggregate neighbor information: GCN applies a spectral convolution over the full adjacency, GAT weights neighbors by learned attention scores, and GraphSAGE samples and aggregates local neighborhoods inductively, enabling generalization to unseen nodes. |
| ScholarGateНабор данных ↗ |
|
|