HCNA: Hyperbolic Contrastive Learning Framework for Self-Supervised Network Alignment

被引:9
作者
Saxena, Shruti [1 ]
Chakraborty, Roshni [2 ]
Chandra, Joydeep [1 ]
机构
[1] Indian Inst Technol, Patna, India
[2] Aalborg Univ, Aalborg, Denmark
关键词
Network alignment; Contrastive learning; Hyperbolic GCN; SMALL-WORLD;
D O I
10.1016/j.ipm.2022.103021
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Network alignment, or identifying the same entities (anchors) across multiple networks, has significant applications across diverse fields. Unsupervised approaches for network alignment, though popular, strictly assume that the anchor nodes' structure and attributes remain consistent across different networks. However, in practice, strictly adhering to these constraints makes it difficult to deal with networks with high variance in the structural characteristics and inherent structural noises like missing nodes and edges, resulting in poor generalization. In order to handle these shortcomings, we propose HCNA: Hyperbolic Contrastive Learning Framework for Self -Supervised Network Alignment , a novel self-supervised contrastive learning model which learns from the multiple augmented views of each network, thereby making HCNA robust to the inherent multi-network characteristics. Furthermore, we propose multi-order hyperbolic graph convolution networks to generate node embedding for each network which can handle the hierarchical structure of networks. The main objective of HCNA is to obtain structure-preserving embeddings that are also robust to noises and variations for better alignment results. The major novelty lies in generating augmented multiple graph views for contrastive learning that are driven by real world network dynamics. Rigorous investigations on 4 real datasets show that HCNA consistently outperforms the baselines by at least 1-84% in terms of accuracy score. Furthermore, HCNA is also more resilient to structural and attributes noises, as evidenced by its adaptivity analysis on adversarial conditions.
引用
收藏
页数:19
相关论文
共 76 条
  • [1] Tree-like structure in large social and information networks
    Adcock, Aaron B.
    Sullivan, Blair D.
    Mahoney, Michael W.
    [J]. 2013 IEEE 13TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2013, : 1 - 10
  • [2] A social recommendation method based on an adaptive neighbor selection mechanism
    Ahmadian, Sajad
    Meghdadi, Majid
    Afsharchi, Mohsen
    [J]. INFORMATION PROCESSING & MANAGEMENT, 2018, 54 (04) : 707 - 725
  • [3] Message-Passing Algorithms for Sparse Network Alignment
    Bayati, Mohsen
    Gleich, David F.
    Saberi, Amin
    Wang, Ying
    [J]. ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2013, 7 (01)
  • [4] Belkin M, 2002, ADV NEUR IN, V14, P585
  • [5] Geometric Deep Learning Going beyond Euclidean data
    Bronstein, Michael M.
    Bruna, Joan
    LeCun, Yann
    Szlam, Arthur
    Vandergheynst, Pierre
    [J]. IEEE SIGNAL PROCESSING MAGAZINE, 2017, 34 (04) : 18 - 42
  • [6] A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
    Cai, HongYun
    Zheng, Vincent W.
    Chang, Kevin Chen-Chuan
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (09) : 1616 - 1637
  • [7] Multi-heterogeneous neighborhood-aware for Knowledge Graphs alignment
    Cai, Weishan
    Wang, Yizhao
    Mao, Shun
    Zhan, Jieyu
    Jiang, Yuncheng
    [J]. INFORMATION PROCESSING & MANAGEMENT, 2022, 59 (01)
  • [8] The small world of human language
    Cancho, RFI
    Solé, RV
    [J]. PROCEEDINGS OF THE ROYAL SOCIETY B-BIOLOGICAL SCIENCES, 2001, 268 (1482) : 2261 - 2265
  • [9] Chami I, 2019, ADV NEUR IN, V32
  • [10] Chen BL, 2020, AAAI CONF ARTIF INTE, V34, P7496