Learning Temporal Representations of Bipartite Financial Graphs

被引:0
|
作者
Nath, Pritam Kumar [1 ]
Waghmare, Govind [1 ]
Tumbde, Nikhil [1 ]
Srivasatava, Nitish [1 ]
Asthana, Siddhartha [1 ]
机构
[1] Mastercard AI Garage, Gurgaon, India
关键词
bipartite graphs; dynamic graph representation learning; graph neural network;
D O I
10.1145/3604237.3626911
中图分类号
F8 [财政、金融];
学科分类号
0202 ;
摘要
Dynamic Bipartite graph is naturally suited for modeling temporally evolving interaction in several domains, including digital payment and social media. Though dynamic graphs are widely studied, their focus remains on homogeneous graphs. This paper proposes a novel framework for representation learning in temporally evolving bipartite graphs. It introduces a bipartite graph transformer layer, a temporal bipartite graph encoder based on an attention mechanism for learning node representations. It further extends the information maximization objective based on noise contrastive learning to temporal bipartite graphs. This combination of bipartite encoder layer and noise contrastive loss ensures each node-set in the temporal bipartite graph is represented uniquely and disentangled from other node-set. We use four public datasets with temporal bipartite characteristics in experimentation. The proposed model shows promising results on the transductive and inductive dynamic link prediction task and on the temporal recommendation task.
引用
收藏
页码:202 / 209
页数:8
相关论文
共 50 条
  • [41] Bipartite dimensions and bipartite degrees of graphs
    AT and T Bell Laboratories, Murray Hill, NJ 07974, United States
    不详
    Discrete Math, 1-3 (127-148):
  • [42] Learning smooth graphs with sparse temporal variations to explore long-term financial trends
    Bastidon, Cecile
    Bontonou, Myriam
    Borgnat, Pierre
    Jensen, Pablo
    Abry, Patrice
    Parent, Antoine
    32ND EUROPEAN SIGNAL PROCESSING CONFERENCE, EUSIPCO 2024, 2024, : 2487 - 2491
  • [43] LEARNING FLEXIBLE REPRESENTATIONS OF STOCHASTIC PROCESSES ON GRAPHS
    Bohannon, Addison W.
    Sadler, Brian M.
    Balan, Radu, V
    2018 IEEE DATA SCIENCE WORKSHOP (DSW), 2018, : 61 - 65
  • [44] Learning Word Representations from Relational Graphs
    Bollegala, Danushka
    Maehara, Takanori
    Yoshida, Yuichi
    Kawarabayashi, Ken-ichi
    PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2015, : 2146 - 2152
  • [45] Learning Structural Node Representations on Directed Graphs
    Steenfatt, Niklas
    Nikolentzos, Giannis
    Vazirgiannis, Michalis
    Zhao, Qiang
    COMPLEX NETWORKS AND THEIR APPLICATIONS VII, VOL 2, 2019, 813 : 132 - 144
  • [46] Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs
    Surynek, Pavel
    2014 IEEE 26TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2014, : 875 - 882
  • [47] Bipartite-threshold graphs and lifting rotations of edges in bipartite graphs
    Baranskii, V. A.
    Sen'chonok, T. A.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2023, 29 (01): : 24 - 35
  • [48] Temporal Graph Benchmark for Machine Learning on Temporal Graphs
    Huang, Shenyang
    Poursafaei, Farimah
    Danovitch, Jacob
    Fey, Matthias
    Hu, Weihua
    Rossi, Emanuele
    Leskovec, Jure
    Bronstein, Michael
    Rabusseau, Guillaume
    Rabbany, Reihaneh
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [49] Symmetric Bipartite Graphs and Graphs with Loops
    Cairns, Grant
    Mendan, Stacey
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2015, 17 (01): : 97 - 102
  • [50] On the decomposition of graphs into complete bipartite graphs
    Dong, Jinquan
    Liu, Yanpei
    GRAPHS AND COMBINATORICS, 2007, 23 (03) : 255 - 262