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 条
  • [1] STWalk: Learning Trajectory Representations in Temporal Graphs
    Pandhre, Supriya
    Mittal, Himangi
    Gupta, Manish
    Balasubramanian, Vineeth N.
    PROCEEDINGS OF THE ACM INDIA JOINT INTERNATIONAL CONFERENCE ON DATA SCIENCE AND MANAGEMENT OF DATA (CODS-COMAD'18), 2018, : 210 - 219
  • [2] Learning Representations for Bipartite Graphs Using Multi-task Self-supervised Learning
    Sethi, Akshay
    Gupta, Sonia
    Malhotra, Aakarsh
    Asthana, Siddhartha
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES: RESEARCH TRACK, ECML PKDD 2023, PT III, 2023, 14171 : 19 - 35
  • [3] Represent-visibility representations of bipartite graphs
    Dean, AM
    Hutchinson, JP
    DISCRETE APPLIED MATHEMATICS, 1997, 75 (01) : 9 - 25
  • [4] Readable representations for large-scale bipartite graphs
    Sato, Shuji
    Misue, Kazuo
    Tanaka, Jiro
    KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 2, PROCEEDINGS, 2008, 5178 : 831 - 838
  • [5] Learning Vertex Representations for Bipartite Networks
    Gao, Ming
    He, Xiangnan
    Chen, Leihui
    Liu, Tingting
    Zhang, Jinglin
    Zhou, Aoying
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (01) : 379 - 393
  • [6] Learning representations on graphs
    Jun Zhu
    National Science Review, 2018, 5 (01) : 21 - 21
  • [7] Reachability Queries on Dynamic Temporal Bipartite Graphs
    Meunier, Lohan
    Zhao, Ying
    31ST ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS, ACM SIGSPATIAL GIS 2023, 2023, : 588 - 598
  • [8] Learning representations on graphs
    Zhu, Jun
    NATIONAL SCIENCE REVIEW, 2018, 5 (01) : 21 - 21
  • [9] Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
    Cai, Xinwei
    Ke, Xiangyu
    Wang, Kai
    Chen, Lu
    Zhang, Tianming
    Liu, Qing
    Gao, Yunjun
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2023, 17 (04): : 657 - 670
  • [10] Hierarchical Representation Learning for Bipartite Graphs
    Li, Chong
    Jia, Kunyang
    Shen, Dan
    Shi, C. J. Richard
    Yang, Hongxia
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 2873 - 2879