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:

Robust graph learning with graph convolutional network
Yingying Wan, Changan Yuan, Mengmeng Zhan, et al.
Information Processing & Management (2022) Vol. 59, Iss. 3, pp. 102916-102916
Closed Access | Times Cited: 14

Showing 14 citing articles:

MIFDELN: A multi-sensor information fusion deep ensemble learning network for diagnosing bearing faults in noisy scenarios
Maoyou Ye, Xiaoan Yan, Dong Jiang, et al.
Knowledge-Based Systems (2023) Vol. 284, pp. 111294-111294
Closed Access | Times Cited: 28

Stock ranking prediction using a graph aggregation network based on stock price and stock relationship information
Guowei Song, Tianlong Zhao, Suwei Wang, et al.
Information Sciences (2023) Vol. 643, pp. 119236-119236
Closed Access | Times Cited: 21

A Hybrid GCN and Filter-Based Framework for Channel and Feature Selection: An fNIRS-BCI Study
Amad Zafar, Karam Dad Kallu, M. Atif Yaqub, et al.
International Journal of Intelligent Systems (2023) Vol. 2023, pp. 1-14
Open Access | Times Cited: 16

Legal Judgment Prediction via graph boosting with constraints
Suxin Tong, Jingling Yuan, Peiliang Zhang, et al.
Information Processing & Management (2024) Vol. 61, Iss. 3, pp. 103663-103663
Closed Access | Times Cited: 6

A point selection method in map generalization using graph convolutional network model
Tianyuan Xiao, Tinghua Ai, Huafei Yu, et al.
Cartography and Geographic Information Science (2023) Vol. 51, Iss. 1, pp. 20-40
Closed Access | Times Cited: 14

Semantic-guided graph neural network for heterogeneous graph embedding
Mingjing Han, Han Zhang, Wei Li, et al.
Expert Systems with Applications (2023) Vol. 232, pp. 120810-120810
Closed Access | Times Cited: 8

Dynamic graph construction via motif detection for stock prediction
Xiang Ma, Xuemei Li, Wenzhi Feng, et al.
Information Processing & Management (2023) Vol. 60, Iss. 6, pp. 103480-103480
Closed Access | Times Cited: 8

Attention-based stackable graph convolutional network for multi-view learning
Zhiyong Xu, Weibin Chen, Ying Zou, et al.
Neural Networks (2024) Vol. 180, pp. 106648-106648
Closed Access | Times Cited: 2

Towards human-like perception: Learning structural causal model in heterogeneous graph
Tianqianjin Lin, Kaisong Song, Zhuoren Jiang, et al.
Information Processing & Management (2023) Vol. 61, Iss. 2, pp. 103600-103600
Open Access | Times Cited: 5

GaitGCN++: Improving GCN-based gait recognition with part-wise attention and DropGraph
Md. Bakhtiar Hasan, Tasnim Ahmed, Sabbir Ahmed, et al.
Journal of King Saud University - Computer and Information Sciences (2023) Vol. 35, Iss. 7, pp. 101641-101641
Open Access | Times Cited: 3

BI-FedGNN: Federated graph neural networks framework based on Bayesian inference
R.Z. Gao, Zhaowei Liu, Chenxi Jiang, et al.
Neural Networks (2023) Vol. 169, pp. 143-153
Open Access | Times Cited: 3

A large-scale data security detection method based on continuous time graph embedding framework
Zhaowei Liu, Weishuai Che, Shenqiang Wang, et al.
Journal of Cloud Computing Advances Systems and Applications (2023) Vol. 12, Iss. 1
Open Access | Times Cited: 2

Node2bert: Only Graph Structure Learning for Robust Node Classification
Mincheol Shin, Hyunwook Yu, Tae-Young Choe, et al.
(2024)
Closed Access

Graph similarity learning for cross-level interactions
Cuifang Zou, Guangquan Lu, Longqing Du, et al.
Information Processing & Management (2024) Vol. 62, Iss. 1, pp. 103932-103932
Closed Access

Page 1

Scroll to top