2020
DOI: 10.1016/j.neunet.2020.06.006
|View full text |Cite
|
Sign up to set email alerts
|

A gentle introduction to deep learning for graphs

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
136
0
1

Year Published

2020
2020
2021
2021

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 222 publications
(157 citation statements)
references
References 68 publications
0
136
0
1
Order By: Relevance
“…We propose two ideas for rumor classification: 1) Detecting rumors based on the propagation graph can be regarded as a graph classification task. The common practice to solve the problem is to represent the whole graph with a single embedding (Bacciu, Errica, & Micheli, 2019). At that point, a standard classifier can be applied to output a graph prediction.…”
Section: Classificationmentioning
confidence: 99%
See 1 more Smart Citation
“…We propose two ideas for rumor classification: 1) Detecting rumors based on the propagation graph can be regarded as a graph classification task. The common practice to solve the problem is to represent the whole graph with a single embedding (Bacciu, Errica, & Micheli, 2019). At that point, a standard classifier can be applied to output a graph prediction.…”
Section: Classificationmentioning
confidence: 99%
“…The global graph embedding is obtained by aggregating all nodes linearly. However, sophisticated aggregation strategy may improve the classification performance (Bacciu et al, 2019). In our work, we aggregate the node representations for graph embedding with attention mechanism.…”
Section: Classificationmentioning
confidence: 99%
“…GNN is becoming increasingly popular, which enjoys the major advantage of incorporating a sparse and discrete dependency structure between data points. A graph allows the representation of a multitude of associations through link orientation and data points [192].…”
Section: Gnnmentioning
confidence: 99%
“…These methods have better performance in prediction and ideal time complexity. However, these methods cannot capture the spatial dependencies and the evolution of the dependencies on the temporal domain simultaneously [7].…”
Section: Introductionmentioning
confidence: 99%