ConTIG: Continuous representation learning on temporal interaction graphs.

Journal: Neural networks : the official journal of the International Neural Network Society
Published Date:

Abstract

Representation learning on temporal interaction graphs (TIG) aims to model complex networks with the dynamic evolution of interactions on a wide range of web and social graph applications. However, most existing works on TIG either (a) rely on discretely updated node embeddings merely when an interaction occurs that fail to capture the continuous evolution of embedding trajectories of nodes, or (b) overlook the rich temporal patterns hidden in the ever-changing graph data that presumably lead to sub-optimal models. In this paper, we propose a two-module framework named ConTIG, a novel representation learning method on TIG that captures the continuous dynamic evolution of node embedding trajectories. With two essential modules, our model exploits three-fold factors in dynamic networks including latest interaction, neighbor features, and inherent characteristics. In the first update module, we employ a continuous inference block to learn the nodes' state trajectories from time-adjacent interaction patterns using ordinary differential equations. In the second transform module, we introduce a self-attention mechanism to predict future node embeddings by aggregating historical temporal interaction information. Experiment results demonstrate the superiority of ConTIG on temporal link prediction, temporal node recommendation, and dynamic node classification tasks of four datasets compared with a range of state-of-the-art baselines, especially for long-interval interaction prediction.

Authors

  • Zihui Wang
    Fujian Key Laboratory of Sensing and Computing for Smart Cities, School of Informatics, Xiamen University, Xiamen, 361000, Fujian, China; Key Laboratory of Multimedia Trusted Perception and Efficient Computing, Ministry of Education of China, Xiamen University, 361005, PR China. Electronic address: wangziwei@stu.xmu.edu.cn.
  • Peizhen Yang
    Fujian Key Laboratory of Sensing and Computing for Smart Cities, School of Informatics, Xiamen University, Xiamen, 361000, Fujian, China; Key Laboratory of Multimedia Trusted Perception and Efficient Computing, Ministry of Education of China, Xiamen University, 361005, PR China. Electronic address: yangpz@stu.xmu.edu.cn.
  • Xiaoliang Fan
    Fujian Key Laboratory of Sensing and Computing for Smart Cities, School of Informatics, Xiamen University, Xiamen, 361000, Fujian, China; Key Laboratory of Multimedia Trusted Perception and Efficient Computing, Ministry of Education of China, Xiamen University, 361005, PR China. Electronic address: fanxiaoliang@xmu.edu.cn.
  • Xu Yan
    Dept of Electrical and Computer Engineering, University of California, Los Angeles, CA, 90024, United States.
  • Zonghan Wu
    Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China; Shenzhen Colleges of Advanced Technology, University of Chinese Academy of Sciences, Beijing, China.
  • Shirui Pan
    Faculty of Information Technology, Monash University, Clayton, Australia.
  • Longbiao Chen
    Fujian Key Laboratory of Sensing and Computing for Smart Cities, School of Informatics, Xiamen University, Xiamen, 361000, Fujian, China; Key Laboratory of Multimedia Trusted Perception and Efficient Computing, Ministry of Education of China, Xiamen University, 361005, PR China. Electronic address: longbiaochen@xmu.edu.cn.
  • Yu Zang
    Department of Hematology, Huizhou First Hospital, Huizhou 516000, China.
  • Cheng Wang
    Department of Pathology, Dalhousie University, Halifax, NS, Canada.
  • Rongshan Yu
    School of Informatics, Xiamen University, Xiamen, China. rsyu@xmu.edu.cn.