Shaolin Tan

dblp:119/4298 · DBLP profile ↗
← Back
4ranked-venue papers in the field
0as first author
4since 2021 · last 2026
0000-0001-6549-9760ORCID · verified

Domains — venue-derived; a paper can count in several

Knowledge Engineering, Semantic Web & Information Systems · 3Database Systems & Data Management · 1
YearPublicationVenuePosition
2026 Vul-CGNN: Code Vulnerability Detection Based on Centrality-Enhanced Graph Neural Network
Zixian Luo, Hongyi Jiang, Ye Tao 0003, Shaolin Tan
KSEM (7)5
2026 K-LDEA: A Knowledge-Driven Layered Defense Enhancement Architecture for OpenPLC Security
Ye Tao 0003, Jinyun Chen, Rui Wang 0118, Shaolin Tan, Qing Gao 0001
KSEM (4)7
2026 RLNA-Net: Reframing Document-Level Relation Extraction with Residual Attention
Rongen Yan, Jinyi Zhan, Ye Tao 0003, Feifei Qian, Shaolin Tan
KSEM (1)5
2023 Elementary Subgraph Features for Link Prediction With Neural Networks
abstract
The enclosing subgraph of a target link has been proved to be effective for prediction of potential links. However, it is still unclear what topological features of the subgraph play the key role in determining the existence of links. To give a possible answer to this question, in this paper, we propose a neural network based learning method for link prediction with only 1-hop neighborhood information. In detail, we extract the one-hop neighborhood of a target link as the enclosing subgraph, then encode the subgraph into different types of topological features, and lastly feed these features to train a fully connected neural network for link prediction. The experimental results show that our proposed learning method with the 1-hop neighborhood features could outperform those heuristic-based methods and achieve nearly equal performance to the state-of-the-art learning-based method WLNM and SEAL. Furthermore, it is observed that these features can be concatenated with attribute vectors to greatly promote the link prediction performance in attributed graphs. This indicates that the topological pattern within an enclosing subgraph, which determines the existence of a possible link, can be aggregated by some elementary subgraph features.
Zhihong Fang, Shaolin Tan, Yaonan Wang 0001, Jinhu Lü 0001
IEEE Trans. Knowl. Data Eng.2