ConTIG: Continuous Representation Learning on Temporal Interaction Graphs

• URL: http://arxiv.org/abs/2110.06088v1
• Date: Mon, 27 Sep 2021 12:11:24 GMT
• Title: ConTIG: Continuous Representation Learning on Temporal Interaction Graphs
• Authors: Xu Yan, Xiaoliang Fan, Peizhen Yang, Zonghan Wu, Shirui Pan, Longbiao Chen, Yu Zang and Cheng Wang
• Abstract summary: ConTIG is a continuous representation method that captures the continuous dynamic evolution of node embedding trajectories. Our model exploit three-fold factors in dynamic networks which include latest interaction, neighbor features and inherent characteristics. Experiments results demonstrate the superiority of ConTIG on temporal link prediction, temporal node recommendation and dynamic node classification tasks.
• Score: 32.25218861788686
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Representation learning on temporal interaction graphs (TIG) is to model complex networks with the dynamic evolution of interactions arising in a broad spectrum of problems. Existing dynamic embedding methods on TIG discretely update node embeddings merely when an interaction occurs. They fail to capture the continuous dynamic evolution of embedding trajectories of nodes. In this paper, we propose a two-module framework named ConTIG, a continuous representation method that captures the continuous dynamic evolution of node embedding trajectories. With two essential modules, our model exploit three-fold factors in dynamic networks which include latest interaction, neighbor features and inherent characteristics. In the first update module, we employ a continuous inference block to learn the nodes' state trajectories by learning from time-adjacent interaction patterns between node pairs 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. Experiments results demonstrate the superiority of ConTIG on temporal link prediction, temporal node recommendation and dynamic node classification tasks compared with a range of state-of-the-art baselines, especially for long-interval interactions prediction.

Related papers

• Interaction Event Forecasting in Multi-Relational Recursive HyperGraphs: A Temporal Point Process Approach [12.142292322071299]
  This work addresses the problem of forecasting higher-order interaction events in multi-relational recursive hypergraphs. The proposed model, textitRelational Recursive Hyperedge Temporal Point Process (RRHyperTPP), uses an encoder that learns a dynamic node representation based on the historical interaction patterns. We have experimentally shown that our models perform better than previous state-of-the-art methods for interaction forecasting.
  arXiv  Detail & Related papers  (2024-04-27T15:46:54Z)
• TempGNN: Temporal Graph Neural Networks for Dynamic Session-Based Recommendations [5.602191038593571]
  Temporal Graph Neural Networks (TempGNN) is a generic framework for capturing the structural and temporal dynamics in complex item transitions. TempGNN achieves state-of-the-art performance on two real-world e-commerce datasets.
  arXiv  Detail & Related papers  (2023-10-20T03:13:10Z)
• Temporal Aggregation and Propagation Graph Neural Networks for Dynamic Representation [67.26422477327179]
  Temporal graphs exhibit dynamic interactions between nodes over continuous time. We propose a novel method of temporal graph convolution with the whole neighborhood. Our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency.
  arXiv  Detail & Related papers  (2023-04-15T08:17:18Z)
• Multi-Task Edge Prediction in Temporally-Dynamic Video Graphs [16.121140184388786]
  We propose MTD-GNN, a graph network for predicting temporally-dynamic edges for multiple types of relations. We show that modeling multiple relations in our temporal-dynamic graph network can be mutually beneficial.
  arXiv  Detail & Related papers  (2022-12-06T10:41:00Z)
• Continuous-Time and Multi-Level Graph Representation Learning for Origin-Destination Demand Prediction [52.0977259978343]
  This paper proposes a Continuous-time and Multi-level dynamic graph representation learning method for Origin-Destination demand prediction (CMOD) The state vectors keep historical transaction information and are continuously updated according to the most recently happened transactions. Experiments are conducted on two real-world datasets from Beijing Subway and New York Taxi, and the results demonstrate the superiority of our model against the state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-06-30T03:37:50Z)
• Learning the Evolutionary and Multi-scale Graph Structure for Multivariate Time Series Forecasting [50.901984244738806]
  We show how to model the evolutionary and multi-scale interactions of time series. In particular, we first provide a hierarchical graph structure cooperated with the dilated convolution to capture the scale-specific correlations. A unified neural network is provided to integrate the components above to get the final prediction.
  arXiv  Detail & Related papers  (2022-06-28T08:11:12Z)
• Spatio-Temporal Joint Graph Convolutional Networks for Traffic Forecasting [75.10017445699532]
  Recent have shifted their focus towards formulating traffic forecasting as atemporal graph modeling problem. We propose a novel approach for accurate traffic forecasting on road networks over multiple future time steps.
  arXiv  Detail & Related papers  (2021-11-25T08:45:14Z)
• Spatio-Temporal Dynamic Inference Network for Group Activity Recognition [7.007702816885332]
  Group activity aims to understand the activity performed by a group of people in order to solve it. Previous methods are limited in reasoning on a predefined graph, which ignores the person-specific context. We propose Dynamic Inference Network (DIN), which composes of Dynamic Relation (DR) module and Dynamic Walk (DW) module.
  arXiv  Detail & Related papers  (2021-08-26T12:40:20Z)
• Deep Structural Point Process for Learning Temporal Interaction Networks [7.288706620982159]
  A temporal interaction network consists of a series of chronological interactions between users and items. Previous methods fail to consider the structural information of temporal interaction networks and inevitably lead to sub-optimal results. We propose a novel Deep Structural Point Process termed as DSPP for learning temporal interaction networks.
  arXiv  Detail & Related papers  (2021-07-08T03:07:34Z)
• TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning [87.38675639186405]
  We propose a novel graph neural network approach, called TCL, which deals with the dynamically-evolving graph in a continuous-time fashion. To the best of our knowledge, this is the first attempt to apply contrastive learning to representation learning on dynamic graphs.
  arXiv  Detail & Related papers  (2021-05-17T15:33:25Z)
• GRADE: Graph Dynamic Embedding [76.85156209917932]
  GRADE is a probabilistic model that learns to generate evolving node and community representations by imposing a random walk prior to their trajectories. Our model also learns node community membership which is updated between time steps via a transition matrix. Experiments demonstrate GRADE outperforms baselines in dynamic link prediction, shows favourable performance on dynamic community detection, and identifies coherent and interpretable evolving communities.
  arXiv  Detail & Related papers  (2020-07-16T01:17:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.