Graph Relational Topic Model with Higher-order Graph Attention Auto-encoders

被引:0
|
作者
Xie, Qianqian [1 ]
Huang, Jimin [2 ]
Du, Pan [3 ]
Peng, Min [2 ]
机构
[1] Univ Manchester, Dept Comp Sci, Manchester, Lancs, England
[2] Wuhan Univ, Sch Comp Sci, Wuhan, Peoples R China
[3] Univ Montreal, Dept Comp Sci & Operat Res, Montreal, PQ, Canada
关键词
NETWORK;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Learning low-dimensional representations of networked documents is a crucial task for documents linked in network structures. Relational Topic Models (RTMs) have shown their strengths in modeling both document contents and relations to discover the latent topic semantic representations. However, higher-order correlation structure information among documents is largely ignored in these methods. Therefore, we propose a novel graph relational topic model (GRTM) for document network, to fully explore and mix neighborhood information of documents on each order, based on the Higher-order Graph Attention Network (HGAT) with the log-normal prior in the graph attention. The proposed method can address the aforementioned issue via the information propagation among document-document based on the HGAT probabilistic encoder, to learn efficient networked document representations in the latent topic space, which can fully reflect document contents, along with document connections. Experiments on several real-world document network datasets show that, through fully exploring information in documents and document networks, our model achieves better performance on unsupervised representation learning and outperforms existing competitive methods in various downstream tasks.
引用
收藏
页码:2604 / 2613
页数:10
相关论文
共 50 条
  • [1] Graph Attention Auto-Encoders
    Salehi, Amin
    Davulcu, Hasan
    [J]. 2020 IEEE 32ND INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2020, : 989 - 996
  • [2] HGATE: Heterogeneous Graph Attention Auto-Encoders
    Wang, Wei
    Suo, Xiaoyang
    Wei, Xiangyu
    Wang, Bin
    Wang, Hao
    Dai, Hong-Ning
    Zhang, Xiangliang
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (04) : 3938 - 3951
  • [3] Directed Graph Auto-Encoders
    Kollias, Georgios
    Kalantzis, Vasileios
    Ide, Tsuyoshi
    Lozano, Aurelie
    Abe, Naoki
    [J]. THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 7211 - 7219
  • [4] Graph Regularized Auto-Encoders for Image Representation
    Liao, Yiyi
    Wang, Yue
    Liu, Yong
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2017, 26 (06) : 2839 - 2852
  • [5] Differential privacy preservation for graph auto-encoders: A novel anonymous graph publishing model
    Li, Xiaolin
    Xu, Li
    Zhang, Hongyan
    Xu, Qikui
    [J]. NEUROCOMPUTING, 2023, 521 : 113 - 125
  • [6] Micro and Macro Level Graph Modeling for Graph Variational Auto-Encoders
    Zahirnia, Kiarash
    Schulte, Oliver
    Naddaf, Parmis
    Li, Ke
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [7] Random Walk Graph Auto-Encoders With Ensemble Networks in Graph Embedding
    Xie, Chengxin
    Wen, Xiumei
    Meng, Fanxing
    Pang, Hui
    [J]. IEEE ACCESS, 2023, 11 : 55204 - 55211
  • [8] Semi-Implicit Graph Variational Auto-Encoders
    Hasanzadeh, Arman
    Hajiramezanali, Ehsan
    Duffield, Nick
    Narayanan, Krishna
    Zhou, Mingyuan
    Qian, Xiaoning
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [9] Application of graph auto-encoders based on regularization in recommendation algorithms
    Xie, Chengxin
    Wen, Xiumei
    Pang, Hui
    Zhang, Bo
    [J]. PEERJ COMPUTER SCIENCE, 2023, 9
  • [10] VARIATIONAL AUTO-ENCODERS WITHOUT GRAPH COARSENING FOR FINE MESH LEARNING
    Vercheval, Nicolas
    De Bie, Hendrik
    Pizurica, Aleksandra
    [J]. 2020 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2020, : 2681 - 2685