Learning temporal attention in dynamic graphs with bilinear interactions

• Published in: PloS one 2021-03, Vol.16 (3), p.e0247936
• Main Authors: Knyazev, Boris, Augusta, Carolyn, Taylor, Graham W
• Format: Article
• Language: English
• Subjects: Algorithms; Artificial Intelligence; Biology and Life Sciences; Computer and Information Sciences; Computer Graphics; Editing; Engineering schools; Epidemiology; Graph theory; Graphical representations; Graphs; Humans; Learning; Network analysis; Neural networks; Neural Networks, Computer; Social networks; Social organization; Social Sciences; Statistical analysis
• ISSN: 1932-6203; 1932-6203
• DOI: 10.1371/journal.pone.0247936

Reasoning about graphs evolving over time is a challenging concept in many domains, such as bioinformatics, physics, and social networks. We consider a common case in which edges can be short term interactions (e.g., messaging) or long term structural connections (e.g., friendship). In practice, long term edges are often specified by humans. Human-specified edges can be both expensive to produce and suboptimal for the downstream task. To alleviate these issues, we propose a model based on temporal point processes and variational autoencoders that learns to infer temporal attention between nodes by observing node communication. As temporal attention drives between-node feature propagation, using the dynamics of node interactions to learn this key component provides more flexibility while simultaneously avoiding issues associated with human-specified edges. We also propose a bilinear transformation layer for pairs of node features instead of concatenation, typically used in prior work, and demonstrate its superior performance in all cases. In experiments on two datasets in the dynamic link prediction task, our model often outperforms the baseline model that requires a human-specified graph. Moreover, our learned attention is semantically interpretable and infers connections similar to actual graphs.