Módszerek összehasonlítása

	Gráfon alapuló neurális hálózat	Temporális hálózatok elemzése
Tudományterület	Hálózatelemzés	Hálózatelemzés
Módszercsalád	Process / pipeline	Process / pipeline
Keletkezés éve	2017–2018 (major variants)	2012
Megalkotó	—	Holme & Saramäki (2012) — seminal framework
Típus	Deep learning on graph-structured data	Dynamic graph analysis
Alapmű	Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. International Conference on Learning Representations (ICLR).	Holme, P. & Saramäki, J. (2012). Temporal Networks. Physics Reports, 519(3), 97-125.
Alternatív nevek	GNN, GCN, GAT, GraphSAGE	dynamic network analysis, time-varying network analysis, Zamansal Ağ Analizi (Temporal / Dynamic Networks)
Kapcsolódó	5	3
Összefoglaló	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.	Temporal network analysis, formalised by Holme and Saramäki in their landmark 2012 Physics Reports survey, is the study of networks in which edges appear and disappear over time. Rather than collapsing all contacts into a single static graph, the approach preserves the precise timing of interactions — whether as contact sequences, time-stamped event lists, or windowed snapshots — and uses that timing to track how influence, disease, or information can actually propagate through the system.