Role Discovery-Guided Network Embedding Based on Autoencoder and Attention Mechanism

被引:8
作者
Jiao, Pengfei [1 ,2 ]
Tian, Qiang [3 ]
Zhang, Wang [3 ]
Guo, Xuan [3 ]
Jin, Di [3 ]
Wu, Huaming [4 ]
机构
[1] Tianjin Univ, Law Sch, Coll Intelligence & Comp, Tianjin 300350, Peoples R China
[2] Tianjin Univ, Law Sch, Ctr Biosafety Res & Strategy, Tianjin 300350, Peoples R China
[3] Tianjin Univ, Coll Intelligence & Comp, Tianjin 300350, Peoples R China
[4] Tianjin Univ, Ctr Appl Math, Tianjin 300072, Peoples R China
基金
中国国家自然科学基金;
关键词
Feature extraction; Task analysis; Social networking (online); Deep learning; Matrix decomposition; Complex networks; Neural networks; Attention mechanism; autoencoder; network representation; role discovery; structural similarity; GRAPH;
D O I
10.1109/TCYB.2021.3094893
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recently, network embedding (NE) is an amazing research point in complex networks and devoted to a variety of tasks. Nearly, all the methods and models of NE are based on the local, high-order, or global similarity of the networks, and few studies have focused on the role discovery or structural similarity, which is of great significance in spreading dynamics and network theory. Meanwhile, existing NE models for role discovery suffer from two limitations, that is: 1) they fail to model the varying dependencies between each node and its neighbor nodes and 2) they cannot capture the effective node features which are helpful to role discovery, which makes these methods ineffective when applied to the role discovery task. To solve the above problems of NE for role discovery or structural similarity, we propose a unified deep learning framework, called RDAA, which can effectively represent features of nodes and benefit the Role Discovery-guided NE with a deep autoencoder, while modeling the local links with an Attention mechanism. In addition, we design an elaborately binding technique to combine both parts and optimize the framework in a unified way. We conduct different experiments, including visualization, role classification, role discovery, and running time compared to popular NE methods for both proximity and structural similarity. The RDAA has better performance on all the datasets and achieves good tradeoffs.
引用
收藏
页码:365 / 378
页数:14
相关论文
共 60 条
  • [1] Role-Based Graph Embeddings
    Ahmed, Nesreen K.
    Rossi, Ryan A.
    Lee, John Boaz
    Willke, Theodore L.
    Zhou, Rong
    Kong, Xiangnan
    Eldardiry, Hoda
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (05) : 2401 - 2415
  • [2] 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
  • [3] Chen H, 2018, ARXIV180802590
  • [4] Chen Ting., 2016, Proceedings of the 2016 SIAM International Conference on Data Mining, P72
  • [5] Chen ZT, 2019, PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2144
  • [6] A Survey on Network Embedding
    Cui, Peng
    Wang, Xiao
    Pei, Jian
    Zhu, Wenwu
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2019, 31 (05) : 833 - 852
  • [7] Dai QY, 2018, AAAI CONF ARTIF INTE, P2167
  • [8] Learning Structural Node Embeddings via Diffusion Wavelets
    Donnat, Claire
    Zitnik, Marinka
    Hallac, David
    Leskovec, Jure
    [J]. KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, : 1320 - 1329
  • [9] Gilpin S, 2013, 19TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'13), P113
  • [10] 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