Node importance evaluation in heterogeneous network based on attention mechanism and graph contrastive learning

被引:1
作者
Shu, Jian [1 ]
Zou, Yiling [1 ]
Cui, Hui [2 ]
Liu, Linlan [2 ]
机构
[1] Nanchang Hangkong Univ, Sch Software, Nanchang 330063, Peoples R China
[2] Nanchang Hangkong Univ, Sch Informat Engn, Nanchang 330063, Peoples R China
基金
中国国家自然科学基金;
关键词
Node importance; Heterogeneous network; Graph contrastive learning; Attention mechanism; IDENTIFYING INFLUENTIAL NODES; COMPLEX NETWORKS; SOCIAL NETWORKS; RANKING NODES; IDENTIFICATION; CENTRALITY; SPREADERS;
D O I
10.1016/j.neucom.2025.129555
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, heterogeneous networks have attracted widespread attention as a modeling approach for complex networks. However, the complex structure and diversity of semantic relations of heterogeneous networks pose challenges to node importance evaluation. In addition, existing methods use SIR model to set true labels for all nodes, which increases the complexity. In light of this, this paper proposes anode importance evaluation in heterogeneous network based on attention mechanism and graph contrastive learning method(AGCL). Specifically, AGCL contains two core parts: node embedding and node importance evaluation. Considering the complex structure of heterogeneous networks, node embedding employs graph contrastive learning to comprehensively extract structural features through neighbor and cross-domain views. Node importance evaluation integrates an attention mechanism to calculate the global and local importance of nodes separately. To reduce the complexity of setting the true labels, a subset of nodes is sampled based on the power-law distribution of node degrees for model training. The evaluation of AGCL is conducted in three real-world networks utilizing three metrics: the maximum connected subgraph node ratio, the maximum propagation range in the linear threshold model, and the maximum propagation range in the independent cascade model. The experiment results demonstrate that AGCL outperforms state-of-the-art techniques in evaluating node importance.
引用
收藏
页数:14
相关论文
共 70 条
[1]   Learning to rank influential nodes in complex networks via convolutional neural networks [J].
Ahmad, Waseem ;
Wang, Bang ;
Chen, Si .
APPLIED INTELLIGENCE, 2024, 54 (04) :3260-3278
[2]   Identifying influential nodes in complex networks [J].
Chen, Duanbing ;
Lu, Linyuan ;
Shang, Ming-Sheng ;
Zhang, Yi-Cheng ;
Zhou, Tao .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) :1777-1787
[3]   Identifying influential nodes in complex networks via Transformer [J].
Chen, Leiyang ;
Xi, Ying ;
Dong, Liang ;
Zhao, Manjun ;
Li, Chenliang ;
Liu, Xiao ;
Cui, Xiaohui .
INFORMATION PROCESSING & MANAGEMENT, 2024, 61 (05)
[4]   CPR-TOPSIS: A novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy [J].
Dong, Chen ;
Xu, Guiqiong ;
Meng, Lei ;
Yang, Pingle .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2022, 603
[5]   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
[6]   The h-index and self-citations [J].
Engqvist, Leif ;
Frommen, Joachim G. .
TRENDS IN ECOLOGY & EVOLUTION, 2008, 23 (05) :250-252
[7]   Subgraph centrality in complex networks -: art. no. 056103 [J].
Estrada, E ;
Rodríguez-Velázquez, JA .
PHYSICAL REVIEW E, 2005, 71 (05)
[8]   Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approach [J].
Fan, Changjun ;
Zeng, Li ;
Ding, Yuhui ;
Chen, Muhao ;
Sun, Yizhou ;
Liu, Zhong .
PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, :559-568
[9]   SET OF MEASURES OF CENTRALITY BASED ON BETWEENNESS [J].
FREEMAN, LC .
SOCIOMETRY, 1977, 40 (01) :35-41
[10]   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