Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery &Amp; Data Mining 2020
DOI: 10.1145/3394486.3403373
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Heterogeneous Graph Neural Network for Real-time Event Prediction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
18
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 49 publications
(20 citation statements)
references
References 14 publications
0
18
0
Order By: Relevance
“…For instance, DynamicGCN [2] was proposed to encode temporal text features into graphs for forecasting societal events and identifying their context graphs. Besides, REGNN [8] was proposed to learn the impact of historical actions and the surrounding environment on the current events for real-time event prediction.…”
Section: A Spatio-temporal Event Predictionmentioning
confidence: 99%
“…For instance, DynamicGCN [2] was proposed to encode temporal text features into graphs for forecasting societal events and identifying their context graphs. Besides, REGNN [8] was proposed to learn the impact of historical actions and the surrounding environment on the current events for real-time event prediction.…”
Section: A Spatio-temporal Event Predictionmentioning
confidence: 99%
“…In this paper, we discussed weighted graph, relational graph, and bipartite graphs; however, heterogeneous graphs are ubiquitous and have unique essential challenges for modeling and learning [22,24,[35][36][37]. We have been seeing heterogeneous GNNs [5,9,23,47] and heterogeneous attention networks for graphs [13,14,38,43,44].…”
Section: Related Work 61 Graph Neural Networkmentioning
confidence: 99%
“…In contrast, the graph structures remains unchanged for epidemiological networks, but the node features inevitably change with increased/decreased patient numbers. It is worth noting that dynamic heterogeneous graphs [14,15,16,17] can be treated as an instance of HTGs, where the dynamic nature comes from the evolving graph structures.…”
Section: Introductionmentioning
confidence: 99%
“…There exist some preliminary works. They could be roughly summarized into two categories: one first explores neural sequence models to process time-series features attached on each node, and then performs graph representation learning with the processed node features on the spatial domain [18,5,6,19]; the other first applies GNNs on each graph slice of a HTG, and then employs sequence models on the outputs of each slice to obtain the final representations [20,16,15]. Although these works could achieve satisfactory results, they are still faced with the following limitations: (1) The existing models are graph-dependent.…”
Section: Introductionmentioning
confidence: 99%