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

被引:0
|
作者
Gracious, Tony [1 ]
Dukkipati, Ambedkar [1 ]
机构
[1] Indian Inst Sci, Bangalore 560012, India
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:7748 / 7756
页数:9
相关论文
共 50 条
  • [1] Higher-order Network Representation Learning
    Rossi, Ryan A.
    Ahmed, Nesreen K.
    Koh, Eunyee
    COMPANION PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2018 (WWW 2018), 2018, : 3 - 4
  • [2] HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers
    Besta, Maciej
    Catarino, Afonso Claudino
    Gianinazzi, Lukas
    Blach, Nils
    Nyczyk, Piotr
    Niewiadomski, Hubert
    Hoefler, Torsten
    LEARNING ON GRAPHS CONFERENCE, VOL 231, 2023, 231
  • [3] HIGHER-ORDER PROCESSES IN THE PHOTON NUCLEUS INTERACTION
    PISK, K
    LJUBICIC, A
    LOGAN, BA
    NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION A-ACCELERATORS SPECTROMETERS DETECTORS AND ASSOCIATED EQUIPMENT, 1987, 255 (1-2): : 28 - 31
  • [4] Simulation of higher-order stochastic processes by spectral representation
    Shields, Michael D.
    Kim, Hwanpyo
    PROBABILISTIC ENGINEERING MECHANICS, 2017, 47 : 1 - 15
  • [5] Efficient Representation Learning for Higher-Order Data with Simplicial Complexes
    Yang, Ruochen
    Sala, Frederic
    Bogdan, Paul
    LEARNING ON GRAPHS CONFERENCE, VOL 198, 2022, 198
  • [6] Rethinking Higher-order Representation Learning with Graph Neural Networks
    Xu, Tuo
    Zou, Lei
    LEARNING ON GRAPHS CONFERENCE, VOL 231, 2023, 231
  • [7] Temporal Higher-Order Contracts
    Disney, Tim
    Flanagan, Cormac
    McCarthy, Jay
    ACM SIGPLAN NOTICES, 2011, 46 (09) : 176 - 188
  • [8] Temporal Higher-Order Contracts
    Disney, Tim
    Flanagan, Cormac
    McCarthy, Jay
    ICFP 11 - PROCEEDINGS OF THE 2011 ACM SIGPLAN: INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING, 2011, : 176 - 188
  • [9] Higher-order learning
    Lewis S.
    Nature Reviews Neuroscience, 2021, 22 (2) : 75 - 75
  • [10] Higher-order learning
    Piotr Evdokimov
    Umberto Garfagnini
    Experimental Economics, 2022, 25 : 1234 - 1266