mlsanityData to 14 Oct 2026

Dynamic Representation Learning with Temporal Point Processes for Higher-Order Interaction Forecasting

arXiv 2112.10154 ↗First posted 19 Dec 2021cs.LG cs.SIcited by 4

Not on the map. Why?

Abstract (arXiv)

The explosion of digital information and the growing involvement of people in social networks led to enormous research activity to develop methods that can extract meaningful information from interaction data. Commonly, interactions are represented by edges in a network or a graph, which implicitly assumes that the interactions are pairwise and static. However, real-world interactions deviate from these assumptions: (i) interactions can be multi-way, involving more than two nodes or individuals (e.g., family relationships, protein interactions), and (ii) interactions can change over a period of time (e.g., change of opinions and friendship status). While pairwise interactions have been studied in a dynamic network setting and multi-way interactions have been studied using hypergraphs in static networks, there exists no method, at present, that can predict multi-way interactions or hyperedges in dynamic settings. Existing related methods cannot answer temporal queries like what type of interaction will occur next and when it will occur. This paper proposes a temporal point process model for hyperedge prediction to address these problems. Our proposed model uses dynamic representation learning techniques for nodes in a neural point process framework to forecast hyperedges. We present several experimental results and set benchmark results. As far as our knowledge, this is the first work that uses the temporal point process to forecast hyperedges in dynamic networks.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 18 of its 31 references that are in the map. First posted on arXiv 19 Dec 2021.

Builds on

18 of 31 references.

References · 18

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
  4. 2020Inductive Representation Learning on Temporal Graphscited by 462
  5. 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 448
  6. 2019Representation Learning for Dynamic Graphs: A Surveycited by 265
  7. 2019Hypergraph Convolution and Hypergraph Attentioncited by 228
  8. 2021Neural Temporal Point Processes: A Reviewcited by 114
  9. 2016Motifs in Temporal Networkscited by 101
  10. 2018Simplicial Closure and higher-order link predictioncited by 93
  11. 2019Hyper-SAGNN: a self-attention based graph neural network for hypergraphscited by 69
  12. 2016Deep Coevolutionary Network: Embedding User and Item Features for Recommendationcited by 33
6 more
  1. 2015Consistency of Spectral Hypergraph Partitioning under Planted Partition Modelcited by 23
  2. 2016Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniquescited by 13
  3. 2021Deep Structural Point Process for Learning Temporal Interaction Networkscited by 8
  4. 2019Hyper-Path-Based Representation Learning for Hyper-Networkscited by 5
  5. 2018A Generative Model for Dynamic Networks with Applicationscited by 3
  6. 2021The CAT SET on the MAT: Cross Attention for Set Matching in Bipartite Hypergraphscited by 1

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 3.

4 papers.