Structure-aware attributed heterogeneous network embedding

被引:5
作者
Wei, Hao [1 ]
Xiong, Gang [1 ]
Wei, Qiang [1 ]
Cao, Weiquan [1 ]
Li, Xin [2 ]
机构
[1] Natl Key Lab Sci & Technol Blind Signal Proc, Chengdu 610041, Peoples R China
[2] Ningbo Univ Finance & Econ, Ningbo 315000, Zejiang, Peoples R China
关键词
Heterogeneous network; Network embedding; Graph embedding; Network representation learning;
D O I
10.1007/s10115-022-01810-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Network embedding in heterogeneous network has recently attracted much attention due to its effectiveness in capturing the structure and inherent properties of networks. Most existing models focus on node proximity of networks. Nevertheless, in heterogeneous network, it contains different types (domains) of nodes and edges. The same types of nodes exhibit global patterns widely known as communities, and a community is intuitively identified as a group of nodes with more connections between its internal nodes compared with the external ones. Similarly, we assume that there is also an intermediate structure in the different types of nodes, which we call it as organization, and nodes in an organization interact more frequently than external ones. Thus, nodes within the same community and organization should have similar node embeddings. Inspired by this, we take the structural characteristics in heterogeneous network into consideration and propose a novel structure-aware Attributed Heterogeneous Network Embedding model (SAHNE). Specifically, we first introduce a random walk strategy based upon node degree to sample node sequences, which can better explore the community and organization information in heterogeneous network. Next, we design a structure-aware attributed heterogeneous network embedding model to simultaneously detect community and organization distribution of each node and learn embeddings of nodes, communities and organizations. Extensive experiments on three real-world heterogeneous networks demonstrate that SAHNE outperforms the state-of-the-art methods in terms of various datamining tasks.
引用
收藏
页码:1769 / 1785
页数:17
相关论文
共 27 条
[1]   MEGNN: Meta-path extracted graph neural network for heterogeneous [J].
Chang, Yaomin ;
Chen, Chuan ;
Hu, Weibo ;
Zheng, Zibin ;
Zhou, Xiaocong ;
Chen, Shouzhi .
KNOWLEDGE-BASED SYSTEMS, 2022, 235
[2]   metapath2vec: Scalable Representation Learning for Heterogeneous Networks [J].
Dong, Yuxiao ;
Chawla, Nitesh V. ;
Swami, Ananthram .
KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, :135-144
[3]   HIN2Vec: Explore Meta-paths in Heterogeneous Information Networks for Representation Learning [J].
Fu, Tao-yang ;
Lee, Wang-Chien ;
Lei, Zhen .
CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, :1797-1806
[4]   MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding [J].
Fu, Xinyu ;
Zhang, Jiani ;
Men, Ziqiao ;
King, Irwin .
WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020), 2020, :2331-2341
[5]   Heterogeneous Graph Transformer [J].
Hu, Ziniu ;
Dong, Yuxiao ;
Wang, Kuansan ;
Sun, Yizhou .
WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020), 2020, :2704-2710
[6]   Are Meta-Paths Necessary? Revisiting Heterogeneous Graph Embeddings [J].
Hussein, Rana ;
Yang, Dingqi ;
Cudre-Mauroux, Philippe .
CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2018, :437-446
[7]   Pre-training on Large-Scale Heterogeneous Graph [J].
Jiang, Xunqiang ;
Jia, Tianrui ;
Fang, Yuan ;
Shi, Chuan ;
Lin, Zhe ;
Wang, Hui .
KDD '21: PROCEEDINGS OF THE 27TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2021, :756-766
[8]   Heterogeneous Graph Neural Network via Attribute Completion [J].
Jin, Di ;
Huo, Cuiying ;
Liang, Chundong ;
Yang, Liang .
PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2021 (WWW 2021), 2021, :391-400
[9]  
Lu YF, 2019, AAAI CONF ARTIF INTE, P4456
[10]  
Mikolov T, 2013, Arxiv, DOI [arXiv:1301.3781, 10.48550/ARXIV.1301.3781, 10.48550/arXiv.1301.3781]