Effective Deep Attributed Network Representation Learning With Topology Adapted Smoothing

被引:61
作者
Chen, Jia [1 ]
Zhong, Ming [1 ]
Li, Jianxin [2 ]
Wang, Dianhui [3 ]
Qian, Tieyun [1 ]
Tu, Hang [4 ]
机构
[1] Wuhan Univ, Sch Comp Sci, Wuhan 430072, Peoples R China
[2] Deakin Univ, Sch Informat Technol, Burwood, Vic 3125, Australia
[3] La Trobe Univ, Dept Comp Sci & Informat Technol, Melbourne, Vic 3083, Australia
[4] Wuhan Univ, Sch Cyber Sci & Engn, Wuhan 430072, Peoples R China
基金
澳大利亚研究理事会; 中国国家自然科学基金;
关键词
Smoothing methods; Laplace equations; Network topology; Topology; Task analysis; Multimedia Web sites; Computer science; Attributed networks; autoencoder; network representation learning; smoothing; SMALL-WORLD;
D O I
10.1109/TCYB.2021.3064092
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Attributed networks are ubiquitous in the real world, such as social networks. Therefore, many researchers take the node attributes into consideration in the network representation learning to improve the downstream task performance. In this article, we mainly focus on an untouched ``oversmoothing'' problem in the research of the attributed network representation learning. Although the Laplacian smoothing has been applied by the state-of-the-art works to learn a more robust node representation, these works cannot adapt to the topological characteristics of different networks, thereby causing the new oversmoothing problem and reducing the performance on some networks. In contrast, we adopt a smoothing parameter that is evaluated from the topological characteristics of a specified network, such as small worldness or node convergency and, thus, can smooth the nodes' attribute and structure information adaptively and derive both robust and distinguishable node features for different networks. Moreover, we develop an integrated autoencoder to learn the node representation by reconstructing the combination of the smoothed structure and attribute information. By observation of extensive experiments, our approach can preserve the intrinsical information of networks more effectively than the state-of-the-art works on a number of benchmark datasets with very different topological characteristics.
引用
收藏
页码:5935 / 5946
页数:12
相关论文
共 36 条
  • [1] Aggarwal CC, 2011, SOCIAL NETWORK DATA ANALYTICS, P1, DOI 10.1007/978-1-4419-8462-3
  • [2] Belkin M, 2002, ADV NEUR IN, V14, P585
  • [3] Relation constrained attributed network embedding
    Chen, Yiqi
    Qian, Tieyun
    [J]. INFORMATION SCIENCES, 2020, 515 : 341 - 351
  • [4] Diversified keyword search based web service composition
    Cheng, Huanyu
    Zhong, Ming
    Wang, Jian
    [J]. JOURNAL OF SYSTEMS AND SOFTWARE, 2020, 163
  • [5] Dai QY, 2018, AAAI CONF ARTIF INTE, P2167
  • [6] Neural-Brane: Neural Bayesian Personalized Ranking for Attributed Network Embedding
    Dave, Vachik S.
    Zhang, Baichuan
    Chen, Pin-Yu
    Al Hasan, Mohammad
    [J]. DATA SCIENCE AND ENGINEERING, 2019, 4 (02) : 119 - 131
  • [7] Gao HC, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P3364
  • [8] 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
  • [9] Huang X., 2017, PROC SIAM INT C DATA, P633, DOI [10.1137/1.9781611974973.71, DOI 10.1137/1.9781611974973.71]
  • [10] Kingma DP, 2014, ADV NEUR IN, V27