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 条
  • [21] Efficient Answering of k-Reachability on Temporal Bipartite Graphs
    Xu, Zhuoqing
    Yang, Zhengyi
    Chen, Xiaoshuang
    He, Huangleshuai
    Cao, Xin
    DATABASES THEORY AND APPLICATIONS, ADC 2024, 2025, 15449 : 224 - 238
  • [22] Efficient algorithms for reachability and path queries on temporal bipartite graphs
    Wang, Kai
    Cai, Minghao
    Chen, Xiaoshuang
    Lin, Xuemin
    Zhang, Wenjie
    Qin, Lu
    Zhang, Ying
    VLDB JOURNAL, 2024, 33 (05): : 1399 - 1426
  • [23] Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
    Wu, Yanping
    Sun, Renjie
    Wang, Xiaoyang
    Wen, Dong
    Zhang, Ying
    Qin, Lu
    Lin, Xuemin
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2024, 17 (11): : 3243 - 3255
  • [24] Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs
    Chen, Xiaoshuang
    Wang, Kai
    Lin, Xuemin
    Zhang, Wenjie
    Qin, Lu
    Zhang, Ying
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2021, 14 (10): : 1845 - 1858
  • [25] Efficient Index for Temporal Core Queries over Bipartite Graphs
    Tian, Anxin
    Zhou, Alexander
    Wang, Yue
    Jian, Xun
    Chen, Lei
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2024, 17 (11): : 2813 - 2825
  • [26] Packing bipartite graphs with covers of complete bipartite graphs
    Chalopin, Jeremie
    Paulusma, Daniel
    DISCRETE APPLIED MATHEMATICS, 2014, 168 : 40 - 50
  • [27] GraPacking Bipartite Graphs with Covers of Complete Bipartite Graphs
    Chalopin, Jeremie
    Paulusma, Daniel
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2010, 6078 : 276 - +
  • [28] Learning Faithful Representations of Causal Graphs
    Balashankar, Ananth
    Subramanian, Lakshminarayanan
    59TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 11TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING, VOL 1 (ACL-IJCNLP 2021), 2021, : 839 - 850
  • [29] Learning Bipartite Graphs: Heavy Tails and Multiple Components
    Cardoso, Jose Vinicius de M.
    Ying, Jiaxi
    Palomar, Daniel P.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [30] Communication Efficient Decentralized Learning Over Bipartite Graphs
    Ben Issaid, Chaouki
    Elgabli, Anis
    Park, Jihong
    Bennis, Mehdi
    Debbah, Merouane
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2022, 21 (06) : 4150 - 4167