Graph Autoencoder with Preserving Node Attribute Similarity

被引:8
|
作者
Lin, Mugang [1 ,2 ]
Wen, Kunhui [1 ]
Zhu, Xuanying [1 ]
Zhao, Huihuang [1 ,2 ]
Sun, Xianfang [3 ]
机构
[1] Hengyang Normal Univ, Coll Comp Sci & Technol, Hengyang 421002, Peoples R China
[2] Hunan Prov Key Lab Intelligent Informat Proc & App, Hengyang 421002, Peoples R China
[3] Cardiff Univ, Sch Comp Sci & Informat, Cardiff CF24 4AG, Wales
基金
中国国家自然科学基金;
关键词
graph representation learning; graph autoencoder; unsupervised learning; k-nearest neighbor;
D O I
10.3390/e25040567
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The graph autoencoder (GAE) is a powerful graph representation learning tool in an unsupervised learning manner for graph data. However, most existing GAE-based methods typically focus on preserving the graph topological structure by reconstructing the adjacency matrix while ignoring the preservation of the attribute information of nodes. Thus, the node attributes cannot be fully learned and the ability of the GAE to learn higher-quality representations is weakened. To address the issue, this paper proposes a novel GAE model that preserves node attribute similarity. The structural graph and the attribute neighbor graph, which is constructed based on the attribute similarity between nodes, are integrated as the encoder input using an effective fusion strategy. In the encoder, the attributes of the nodes can be aggregated both in their structural neighborhood and by their attribute similarity in their attribute neighborhood. This allows performing the fusion of the structural and node attribute information in the node representation by sharing the same encoder. In the decoder module, the adjacency matrix and the attribute similarity matrix of the nodes are reconstructed using dual decoders. The cross-entropy loss of the reconstructed adjacency matrix and the mean-squared error loss of the reconstructed node attribute similarity matrix are used to update the model parameters and ensure that the node representation preserves the original structural and node attribute similarity information. Extensive experiments on three citation networks show that the proposed method outperforms state-of-the-art algorithms in link prediction and node clustering tasks.
引用
收藏
页数:22
相关论文
共 50 条
  • [31] Preserving Node-level Privacy in Graph Neural Networks
    Xiang, Zihang
    Wang, Tianhao
    Wang, Di
    45TH IEEE SYMPOSIUM ON SECURITY AND PRIVACY, SP 2024, 2024, : 4714 - 4732
  • [32] Graph attention network via node similarity for link prediction
    Yang, Kai
    Liu, Yuan
    Zhao, Zijuan
    Zhou, Xingxing
    Ding, Peijin
    EUROPEAN PHYSICAL JOURNAL B, 2023, 96 (03):
  • [33] Similarity-navigated graph neural networks for node classification
    Zou, Minhao
    Gan, Zhongxue
    Cao, Ruizhi
    Guan, Chun
    Leng, Siyang
    INFORMATION SCIENCES, 2023, 633 : 41 - 69
  • [34] Reliable Node Similarity Matrix Guided Contrastive Graph Clustering
    Liu, Yunhui
    Gao, Xinyi
    He, Tieke
    Zheng, Tao
    Zhao, Jianhua
    Yin, Hongzhi
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (12) : 9123 - 9135
  • [35] MEASURING GRAPH SIMILARITY USING NODE INDEXING AND MESSAGE PASSING
    Shen, Gang
    Li, Wei
    2011 3RD INTERNATIONAL CONFERENCE ON COMPUTER TECHNOLOGY AND DEVELOPMENT (ICCTD 2011), VOL 2, 2012, : 787 - 792
  • [36] Constructing Graph Node Embeddings via Discrimination of Similarity Distributions
    Tsepa, Stanislav
    Panov, Maxim
    2018 18TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS (ICDMW), 2018, : 1050 - 1053
  • [37] Structure Similarity Graph for Cross-Network Node Classification
    Li, Xinzheng
    Zhang, Yuhong
    Li, Peipei
    Hu, Xuegang
    2022 IEEE 34TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, ICTAI, 2022, : 441 - 445
  • [38] Vital node identification in complex networks based on autoencoder and graph neural network
    Xiong, You
    Hu, Zheng
    Su, Chang
    Cai, Shi-Min
    Zhou, Tao
    APPLIED SOFT COMPUTING, 2024, 163
  • [39] Node-attribute graph layout for small-world networks
    Gibson, Helen
    Faith, Joe
    15TH INTERNATIONAL CONFERENCE ON INFORMATION VISUALISATION (IV 2011), 2011, : 482 - 487
  • [40] Graph attention network via node similarity for link prediction
    Kai Yang
    Yuan Liu
    Zijuan Zhao
    Xingxing Zhou
    Peijin Ding
    The European Physical Journal B, 2023, 96