Adversarial Separation Network for Cross-Network Node Classification

被引:26
作者
Zhang, Xiaowen [1 ]
Du, Yuntao [1 ]
Xie, Rongbiao [1 ]
Wang, Chongjun [1 ]
机构
[1] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing, Jiangsu, Peoples R China
来源
PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021 | 2021年
基金
中国国家自然科学基金;
关键词
cross-network node classification; transfer learning; domain adaptation; graph embedding;
D O I
10.1145/3459637.3482228
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Node classification is an important yet challenging task in various network applications, and many effective methods have been developed for a single network. While for cross-network scenarios, neither single network embedding nor traditional domain adaptation can directly solve the task. Existing approaches have been proposed to combine network embedding and domain adaptation for cross-network node classification. However, they only focus on domain-invariant features, ignoring the individual features of each network, and they only utilize 1-hop neighborhood information (local consistency), ignoring the global consistency information. To tackle the above problems, in this paper, we propose a novel model, Adversarial Separation Network (ASN), to learn effective node representations between source and target networks. We explicitly separate domain-private and domain-shared information. Two domain-private encoders are employed to extract the domain-specific features in each network and a shared encoder is employed to extract the domain-invariant shared features across networks. Moreover, in each encoder, we combine local and global consistency to capture network topology information more comprehensively. ASN integrates deep network embedding with adversarial domain adaptation to reduce the distribution discrepancy across domains. Extensive experiments on real-world datasets show that our proposed model achieves state-of-the-art performance in cross-network node classification tasks compared with existing algorithms.
引用
收藏
页码:2618 / 2626
页数:9
相关论文
共 47 条
  • [1] Bhagat S, 2011, SOCIAL NETWORK DATA ANALYTICS, P115
  • [2] Bousmalis K, 2016, ADV NEUR IN, V29
  • [3] Cao SS, 2016, AAAI CONF ARTIF INTE, P1145
  • [4] Chen F, 2019, 57TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2019), P2197
  • [5] Cukierski W, 2011, 2011 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), P1237, DOI 10.1109/IJCNN.2011.6033365
  • [6] Dai Quanyu, 2019, ABS190901541 ARXIV
  • [7] A min-max cut algorithm for graph partitioning and data clustering
    Ding, CHQ
    He, XF
    Zha, HY
    Gu, M
    Simon, HD
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 107 - 114
  • [8] Transfer Learning across Networks for Collective Classification
    Fang, Meng
    Yin, Jie
    Zhu, Xingquan
    [J]. 2013 IEEE 13TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2013, : 161 - 170
  • [9] Ganin Y., 2017, J.Mach. Learn. Res., V17, P2096
  • [10] Ganin Y, 2015, PR MACH LEARN RES, V37, P1180