Learning asymmetric embedding for attributed networks via convolutional neural network

被引:3
作者
Radmanesh, Mohammadreza [1 ]
Ghorbanzadeh, Hossein [2 ]
Rezaei, Ahmad Asgharian [1 ]
Jalili, Mahdi [1 ]
Yu, Xinghuo [1 ]
机构
[1] RMIT Univ, Sch Engn, Melbourne, Australia
[2] Islamic Azad Univ, Dept Comp Engn, Ahvaz Branch, Ahvaz, Iran
基金
澳大利亚研究理事会;
关键词
Deep network embedding; Convolutional graph neural network; Directed attributed networks; Asymmetric proximity and similarity;
D O I
10.1016/j.eswa.2023.119659
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently network embedding has gained increasing attention due to its advantages in facilitating network computation tasks such as link prediction, node classification and node clustering. The objective of network embedding is to represent network nodes in a low-dimensional vector space while retaining as much information as possible from the original network including structural, relational, and semantic information. However, asymmetric nature of directed networks poses many challenges as how to best preserve edge directions during the embedding process. Here, we propose a novel deep asymmetric attributed network embedding model based on the convolutional graph neural network, called AAGCN. The main idea is to maximally preserve the asym-metric proximity and asymmetric similarity of directed attributed networks. AAGCN introduces two neigh-bourhood feature aggregation schemes to separately aggregate the features of a node with the features of its in -and out-neighbours. Then, it learns two embedding vectors for each node, one source embedding vector and one target embedding vector. The final representations are the results of concatenating source and target embedding vectors. We test the performance of AAGCN on four real-world networks for network reconstruction, link pre-diction, node classification and visualization downstream tasks and investigate the impact of hyperparameters of the proposed method on the performance of the tasks. The experimental results show the superiority of AAGCN against state-of-the-art embedding methods.
引用
收藏
页数:12
相关论文
共 48 条
  • [1] Learning Edge Representations via Low-Rank Asymmetric Projections
    Abu-El-Haija, Sami
    Perozzi, Bryan
    Al-Rfou, Rami
    [J]. CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 1787 - 1796
  • [2] Friends and neighbors on the Web
    Adamic, LA
    Adar, E
    [J]. SOCIAL NETWORKS, 2003, 25 (03) : 211 - 230
  • [3] [Anonymous], 2015, P 24 ACM INT C INF K
  • [4] Cascading Failure Tolerance of Modular Small-World Networks
    Babaei, Mahmoudreza
    Ghassemieh, Hamed
    Jalili, Mahdi
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2011, 58 (08) : 527 - 531
  • [5] EVALUATING TRAUMA CARE - THE TRISS METHOD
    BOYD, CR
    TOLSON, MA
    COPES, WS
    [J]. JOURNAL OF TRAUMA-INJURY INFECTION AND CRITICAL CARE, 1987, 27 (04) : 370 - 378
  • [6] Heterogeneous Network Embedding via Deep Architectures
    Chang, Shiyu
    Han, Wei
    Tang, Jiliang
    Qi, Guo-Jun
    Aggarwal, Charu C.
    Huang, Thomas S.
    [J]. KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, : 119 - 128
  • [7] An Efficient Memristor-Based Circuit Implementation of Squeeze-and-Excitation Fully Convolutional Neural Networks
    Chen, Jiadong
    Wu, Yincheng
    Yang, Yin
    Wen, Shiping
    Shi, Kaibo
    Bermak, Amine
    Huang, Tingwen
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2022, 33 (04) : 1779 - 1790
  • [8] Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks
    Chiang, Wei-Lin
    Liu, Xuanqing
    Si, Si
    Li, Yang
    Bengio, Samy
    Hsieh, Cho-Jui
    [J]. KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 257 - 266
  • [9] Asymmetric Node Similarity Embedding for Directed Graphs
    Dernbach, Stefan
    Towsley, Don
    [J]. COMPLEX NETWORKS XI, 2020, : 83 - 91
  • [10] Giles C.L., 1998, P 3 ACM C DIGITAL LI