Proceedings of the 13th International Conference on Web Search and Data Mining 2020
DOI: 10.1145/3336191.3371845
|View full text |Cite
|
Sign up to set email alerts
|

DySAT

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
65
0
1

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 370 publications
(85 citation statements)
references
References 14 publications
0
65
0
1
Order By: Relevance
“…Such as EvolveGCN [22] uses the RNN model to update the parameters of GCN for future snapshots. DySAT [23] combines graph structure and dynamic information to generate self-weighted node representations.…”
Section: Related Workmentioning
confidence: 99%
“…Such as EvolveGCN [22] uses the RNN model to update the parameters of GCN for future snapshots. DySAT [23] combines graph structure and dynamic information to generate self-weighted node representations.…”
Section: Related Workmentioning
confidence: 99%
“…These networks differ from one another in the techniques used for processing both the structural information and the temporal dynamics of the STGs. DySAT [38] introduced a generalization of Graph Attention Network (GAT) [44] for STGs. First, it uses a self-attention mechanism to generate static node embeddings at each timestamp.…”
Section: Embedding Evolution Methodsmentioning
confidence: 99%
“…The domain of the function f LP is the set of all feasible pairs of nodes, since it is possible to predict the probability of future interactions between nodes that have been connected in the past or not, as well as the probability of missing edges in a past time. Most TGNN approaches for temporal link prediction focus on future predictions, forecasting the existence of an edge in a future timestamp between existing nodes (FT is the most common setting) [31,38,16,55,50,26,45,27,36,58], or unseen nodes (FI) [16,50,36]. The only model that investigates past temporal link prediction is [26], which devises a PI setting by masking some nodes and predicting the existence of a past edge between them.…”
Section: Link Predictionmentioning
confidence: 99%
See 1 more Smart Citation
“…Given a sequence of knowledge graphs built on the extracted entities and relations, we aim to learn rich node representations over time by encoding both temporal evolution patterns and structural neighbourhood information [ 58 ], which can be useful for monitoring the pandemics and identifying the risk factors. Specifically, we formulate the task into a time-series prediction problem.…”
Section: Methodsmentioning
confidence: 99%