Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Identify influential nodes in social networks with graph multi-head attention regression model
Jiangheng Kou, Peng Jia, Jiayong Liu, et al.
Neurocomputing (2023) Vol. 530, pp. 23-36
Closed Access | Times Cited: 13

Showing 13 citing articles:

Node importance evaluation in heterogeneous network based on attention mechanism and graph contrastive learning
Jian Shu, Yiling Zou, Hui Cui, et al.
Neurocomputing (2025), pp. 129555-129555
Closed Access
MEGA: identifying influential nodes in heterogeneous networks based on meta-path and attention
Jiahao Xie, Jianyong Yu, Z. Chen
Journal of Statistical Mechanics Theory and Experiment (2025) Vol. 2025, Iss. 2, pp. 023401-023401
Closed Access
A knowledge graph attention network for the cold‐start problem in intelligent manufacturing: Interpretability and accuracy improvement
Z. Y. Zhou, Yuqi Zhang, Shuize Wang, et al.
Materials Genome Engineering Advances (2025)
Open Access
Detection of Effective Devices in Information Dissemination on the Complex Social Internet of Things Networks Based on Device Centrality Measures
Wei Deng, J. Deng, Peyman Arebi
Complexity (2025) Vol. 2025, Iss. 1
Open Access
Identifying Influential Nodes Based on Evidence Theory in Complex Network
Fu Tan, Xiaolong Chen, Rui Chen, et al.
Entropy (2025) Vol. 27, Iss. 4, pp. 406-406
Open Access
Conformity-aware adoption maximization in competitive social networks
Yonggang Liu, Yikun Hu, Siyang Yu, et al.
Neurocomputing (2024) Vol. 573, pp. 127224-127224
Closed Access | Times Cited: 3
Multi-factor information matrix: A directed weighted method to identify influential nodes in social networks
Yan Wang, Ling Zhang, Junwen Yang, et al.
Chaos Solitons & Fractals (2024) Vol. 180, pp. 114485-114485
Closed Access | Times Cited: 3
Vital node identification in complex networks based on autoencoder and graph neural network
You Xiong, Zheng Hu, Chang Su, et al.
Applied Soft Computing (2024) Vol. 163, pp. 111895-111895
Closed Access | Times Cited: 3
Key Nodes Evaluation Method Based on Combination Weighting VIKOR in Social Networks
Jian Shu, Y. Daniel Liang, Wanli Ma, et al.
IEEE Transactions on Computational Social Systems (2024) Vol. 11, Iss. 4, pp. 5404-5418
Closed Access | Times Cited: 2
Identifying influential nodes on directed networks
Yan-Li Lee, Yi-Fei Wen, Wen-Bo Xie, et al.
Information Sciences (2024) Vol. 677, pp. 120945-120945
Closed Access | Times Cited: 2
A graph convolutional network model based on regular equivalence for identifying influential nodes in complex networks
Yihang Wu, Yanmei Hu, Siyuan Yin, et al.
Knowledge-Based Systems (2024) Vol. 301, pp. 112235-112235
Closed Access | Times Cited: 2
GCNT: Identify influential seed set effectively in social networks by integrating graph convolutional networks with graph transformers
Jianxin Tang, Jitao Qu, Shihui Song, et al.
Journal of King Saud University - Computer and Information Sciences (2024) Vol. 36, Iss. 8, pp. 102183-102183
Open Access | Times Cited: 2
Multi-Factor Information Matrix: A Directed Weighted Method to Identify Influential Nodes in Social Networks
Yan Wang, Ling Zhang, Junwen Yang, et al.
(2023)
Closed Access
Rgm：A Reachability Gravity Model for Identifying Important Spreaders in Directed Networks
Yan Wang, Junwen Yang, Ling Zhang, et al.
(2023)
Closed Access
Page 1

Scroll to top