Heterogeneous Dynamic Graph Attention Network

被引:20
作者
Li, Qiuyan [1 ]
Shang, Yanlei [1 ]
Qiao, Xiuquan [1 ]
Dai, Wei [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Inst Network Technol, Beijing, Peoples R China
来源
11TH IEEE INTERNATIONAL CONFERENCE ON KNOWLEDGE GRAPH (ICKG 2020) | 2020年
基金
中国国家自然科学基金;
关键词
network embedding; heterogeneous dynamic network; attention mechanism;
D O I
10.1109/ICBK50248.2020.00064
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Network embedding (graph embedding) has become the focus of studying graph structure in recent years. In addition to the research on homogeneous networks and heterogeneous networks, there are also some methods to attempt to solve the problem of dynamic network embedding. However, in dynamic networks, there is no research method specifically for heterogeneous networks. Therefore, this paper proposes a heterogeneous dynamic graph attention network (HDGAN), which attempts to use the attention mechanism to take the heterogeneity and dynamics of the network into account at the same time, so as to better learn network embedding. Our method is based on three levels of attention, namely structural-level attention, semantic-level attention and time-level attention. Structural-level attention pays attention to the network structure itself, and obtains the representation of structural-level nodes by learning the attention coefficients of neighbor nodes. Semantic-level attention integrates semantic information into the representation of nodes by learning the optimal weighted combination of different meta-paths. Time-level attention is based on the time decay effect, and the time feature is introduced into the node representation by neighborhood formation sequence. Through the above three levels of attention mechanism, the final network embedding can be obtained. Through experiments on two real-world heterogeneous dynamic networks, our models have the best results, proving the effectiveness of the HDGAN model.
引用
收藏
页码:404 / 411
页数:8
相关论文
共 22 条
  • [1] Cao Shaosheng, 2015, P 24 ACM INT C INF K, P891, DOI DOI 10.1145/2806416.2806512
  • [2] Learning Community Embedding with Community Detection and Node Embedding on Graphs
    Cavallari, Sandro
    Zheng, Vincent W.
    Cai, Hongyun
    Chang, Kevin Chen-Chuan
    Cambria, Erik
    [J]. CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 377 - 386
  • [3] Cucurull G., 2018, ICLR
  • [4] Learning Laplacian Matrix in Smooth Graph Signal Representations
    Dong, Xiaowen
    Thanou, Dorina
    Frossard, Pascal
    Vandergheynst, Pierre
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2016, 64 (23) : 6160 - 6173
  • [5] metapath2vec: Scalable Representation Learning for Heterogeneous Networks
    Dong, Yuxiao
    Chawla, Nitesh V.
    Swami, Ananthram
    [J]. KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, : 135 - 144
  • [6] node2vec: Scalable Feature Learning for Networks
    Grover, Aditya
    Leskovec, Jure
    [J]. KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, : 855 - 864
  • [7] Hamilton W.L., 2017, ADV NEUR IN, P1025
  • [8] HAWKES AG, 1971, BIOMETRIKA, V58, P83, DOI 10.1093/biomet/58.1.83
  • [9] Henaff M., 2015, PREPRINT
  • [10] Li RY, 2018, AAAI CONF ARTIF INTE, P3546