Shilong Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shilong Wang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Yijia Zhang
School of Information Science and Technology, Dalian Maritime University, Dalian, China
8 shared publications - Hai Cui
Information Science and Technology College, Dalian Maritime University, Dalian, China
4 shared publications - Yanchen Qu
Information Science and Technology College, Dalian Maritime University, Dalian, China
3 shared publications - Xiaodi Hou
School of Artificial Intelligence, Dalian Maritime University, Dalian, China
2 shared publications - Chunling Wang
School of Information Science and Technology, Dalian Maritime University, Dalian 116024, Liaoning, China
1 shared publication - Haijia Bi
College of Computer Science and Technology, Jilin University, Changchun, 130012, Jilin, China
1 shared publication
Latest Publications
- 25 May 2026
- Published by Elsevier in Neural Networks
- Vol. 203, 109168
Debiased medication recommendation through fusing frequent pattern and temporal medical records
- 25 May 2026
- Published by Elsevier in Neural Networks
- Vol. 203, 109168
Debiased medication recommendation through fusing frequent pattern and temporal medical records
- 3 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 321
Multi-semantic information transfer network for knowledge graph-based synthetic lethality prediction
- 3 April 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 321
Multi-semantic information transfer network for knowledge graph-based synthetic lethality prediction
- 22 January 2026
- Published by Elsevier in Neural Networks
- Vol. 198, 108618
Relation-aware pre-trained network with hierarchical aggregation mechanism for cold-start drug recommendation
- 22 January 2026
- Published by Elsevier in Neural Networks
- Vol. 198, 108618
Relation-aware pre-trained network with hierarchical aggregation mechanism for cold-start drug recommendation
- 22 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 30 (4) , 3208-3218
KEGCL: Knowledge-Enhanced Graph Contrastive Learning for Protein Complex Identification
Protein complexes play essential roles in cellular functions, and accurate identification of these complexes is critical for understanding biological processes and disease mechanisms. Existing methods frequently compromise the global topology of protein-protein interaction (PPI) networks when incorporating biological resources. Moreover, they fail to adequately address the intrinsic sparsity of PPI data and the widespread occurrence of false positives and false negatives. These approaches also struggle to capture the diverse neighborhood dependencies necessary to represent distinct functional roles of proteins within complexes. To address these limitations, we propose a knowledge-enhanced graph contrastive learning (KEGCL) framework for protein complex identification. KEGCL constructs a knowledge-enhanced PPI network by integrating external biological priors. A perturbation strategy guided by spatiotemporal constraints is then applied to selectively reintroduce functionally relevant interactions, thereby enhancing semantic diversity in the generated graph views. Based on this, graph convolutional encoders with randomized propagation depths are used to capture protein interaction patterns at multiple structural levels, enhancing the model's ability to represent both densely connected cores and loosely associated attachments within protein complexes. Extensive experiments on multiple real-world PPI datasets show that KEGCL achieves competitive performance compared with state-of-the-art methods, and enrichment analyses confirm the biological relevance of the identified complexes. Source code and data are available at https://github.com/quyanchen/KEGCL.
- 22 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 30 (4) , 3208-3218
KEGCL: Knowledge-Enhanced Graph Contrastive Learning for Protein Complex Identification
Protein complexes play essential roles in cellular functions, and accurate identification of these complexes is critical for understanding biological processes and disease mechanisms. Existing methods frequently compromise the global topology of protein-protein interaction (PPI) networks when incorporating biological resources. Moreover, they fail to adequately address the intrinsic sparsity of PPI data and the widespread occurrence of false positives and false negatives. These approaches also struggle to capture the diverse neighborhood dependencies necessary to represent distinct functional roles of proteins within complexes. To address these limitations, we propose a knowledge-enhanced graph contrastive learning (KEGCL) framework for protein complex identification. KEGCL constructs a knowledge-enhanced PPI network by integrating external biological priors. A perturbation strategy guided by spatiotemporal constraints is then applied to selectively reintroduce functionally relevant interactions, thereby enhancing semantic diversity in the generated graph views. Based on this, graph convolutional encoders with randomized propagation depths are used to capture protein interaction patterns at multiple structural levels, enhancing the model's ability to represent both densely connected cores and loosely associated attachments within protein complexes. Extensive experiments on multiple real-world PPI datasets show that KEGCL achieves competitive performance compared with state-of-the-art methods, and enrichment analyses confirm the biological relevance of the identified complexes. Source code and data are available at https://github.com/quyanchen/KEGCL.
- 29 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 30 (6) , 4525-4534
Knowledge-Driven and Relation-Aware Synergistic Learning for Drug Repositioning
As an effective and low-risk approach to identify new therapeutic pathways for existing drugs, drug repositioning has been extensively utilized to expedit drug discovery processes. However, current knowledge graph (KG)-based methodologies encounter several hurdles in this context. Firstly, most graph neural network (GNN)- based approaches fail to adequately capture the intricate relationships between drug-drug, drug-disease, or diseasedisease. Secondly, the subtle synergistic mechanisms between drugs and diseases remain underexplored. Lastly, the training of knowledge graph embedding (KGE) methods is susceptible to noise, leading to unstable model optimization. To address these challenges, we intruduce KRANE, a knowledge-driven and relation-aware synergistic learning method for drug repositioning. KRANE addresses these issues through three innovative modules. Firstly, we design a relation-aware feature extractor (RAFE), which utilizes the contextual triples attention scores in KG to effectively integrate drug-related knowledge and enhance the representation of complex relational features. Secondly, we adopt a synergistic feature reconstruction module as a decoder to extract synergistic heterogeneous feature interactions between drugs and diseases from entity and relation representations. Finally, we propose a knowledgeregulated loss function to mitigate the impact of noise on model training. Experiments conducted on three publicly available datasets demonstrate that KRANE significantly outperforms existing methods. The source code and datasets are available at https://github.com/qifen37/KRANE.
- 29 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 30 (6) , 4525-4534
Knowledge-Driven and Relation-Aware Synergistic Learning for Drug Repositioning
As an effective and low-risk approach to identify new therapeutic pathways for existing drugs, drug repositioning has been extensively utilized to expedit drug discovery processes. However, current knowledge graph (KG)-based methodologies encounter several hurdles in this context. Firstly, most graph neural network (GNN)- based approaches fail to adequately capture the intricate relationships between drug-drug, drug-disease, or diseasedisease. Secondly, the subtle synergistic mechanisms between drugs and diseases remain underexplored. Lastly, the training of knowledge graph embedding (KGE) methods is susceptible to noise, leading to unstable model optimization. To address these challenges, we intruduce KRANE, a knowledge-driven and relation-aware synergistic learning method for drug repositioning. KRANE addresses these issues through three innovative modules. Firstly, we design a relation-aware feature extractor (RAFE), which utilizes the contextual triples attention scores in KG to effectively integrate drug-related knowledge and enhance the representation of complex relational features. Secondly, we adopt a synergistic feature reconstruction module as a decoder to extract synergistic heterogeneous feature interactions between drugs and diseases from entity and relation representations. Finally, we propose a knowledgeregulated loss function to mitigate the impact of noise on model training. Experiments conducted on three publicly available datasets demonstrate that KRANE significantly outperforms existing methods. The source code and datasets are available at https://github.com/qifen37/KRANE.
- 10 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 29 (9) , 6902-6914
Multi-View Contrastive Learning for Drug Repositioning on Heterogeneous Biological Networks
Drug repositioning, which identifies new therapeutic potential of approved drugs, is instrumental in accelerating drug discovery. Recently, to alleviate the effect of data sparsity on predicting possible drug-disease associations (DDAs), graph contrastive learning (GCL) has emerged as a promising paradigm for learning discriminative representations of drugs and diseases through distilling informative self-supervised signals. However, existing GCLbased methods devised for DDA prediction still encounter two limitations. Firstly, the crucial heterogeneous property, which allows for capturing nuanced interaction semantics between biological entities, is overlooked. The second is how to perform contrastive view augmentation without relying on stochastic perturbation. In this study, we propose a novel multi-view contrastive learning approach for DDA prediction, namely MICLE. To handle the first issue, proteinrelated bipartite graphs are integrated with the original DDA network in advance, thereby composing a heterogeneous biological network (HBN). Besides, heterogeneous graph neural network is applied to mine the rich connectivity patterns implicit in the above HBN. For the second limitation, we design the complementary inter-view and intra-view contrastive learning tasks. Specifically, the former ensures that the mutual information between paired nodes across views is maximized, the latter enhances the agreement between each node and its first-order neighbors on similarity networks. Extensive experiments conducted on three benchmarks under 10-fold cross-validation demonstrate the model effectiveness. Source code and datasets are available at https://github.com/OleCui/paper MICLE.
- 10 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Biomedical and Health Informatics
- Vol. 29 (9) , 6902-6914
Multi-View Contrastive Learning for Drug Repositioning on Heterogeneous Biological Networks
Drug repositioning, which identifies new therapeutic potential of approved drugs, is instrumental in accelerating drug discovery. Recently, to alleviate the effect of data sparsity on predicting possible drug-disease associations (DDAs), graph contrastive learning (GCL) has emerged as a promising paradigm for learning discriminative representations of drugs and diseases through distilling informative self-supervised signals. However, existing GCLbased methods devised for DDA prediction still encounter two limitations. Firstly, the crucial heterogeneous property, which allows for capturing nuanced interaction semantics between biological entities, is overlooked. The second is how to perform contrastive view augmentation without relying on stochastic perturbation. In this study, we propose a novel multi-view contrastive learning approach for DDA prediction, namely MICLE. To handle the first issue, proteinrelated bipartite graphs are integrated with the original DDA network in advance, thereby composing a heterogeneous biological network (HBN). Besides, heterogeneous graph neural network is applied to mine the rich connectivity patterns implicit in the above HBN. For the second limitation, we design the complementary inter-view and intra-view contrastive learning tasks. Specifically, the former ensures that the mutual information between paired nodes across views is maximized, the latter enhances the agreement between each node and its first-order neighbors on similarity networks. Extensive experiments conducted on three benchmarks under 10-fold cross-validation demonstrate the model effectiveness. Source code and datasets are available at https://github.com/OleCui/paper MICLE.
- Open Access
- 22 November 2024
- Published by Oxford University Press (OUP) in Briefings in Bioinformatics
- Vol. 26 (1)
Multi-source biological knowledge-guided hypergraph spatiotemporal subnetwork embedding for protein complex identification
Identifying biologically significant protein complexes from protein–protein interaction (PPI) networks and understanding their roles are essential for elucidating protein functions, life processes, and disease mechanisms. Current methods typically rely on static PPI networks and model PPI data as pairwise relationships, which presents several limitations. Firstly, static PPI networks do not adequately represent the scopes and temporal dynamics of protein interactions. Secondly, a large amount of available biological resources have not been fully integrated. Moreover, PPIs in biological systems are not merely one-to-one relationships but involve higher order non-pairwise interactions. To alleviate these issues, we propose HGST, a multi-source biological knowledge-guided hypergraph spatiotemporal subnetwork (subnet) embedding method for identifying biologically significant protein complexes from PPI networks. HGST initially constructs spatiotemporal PPI subnets using the scopes and temporal dynamics of proteins derived from multi-source biological knowledge, treating them as dynamic networks through fine-grained spatiotemporal partitioning. The spatiotemporal subnets are then transformed into hypergraphs, which model higher order non-pairwise relationships via hypergraph embedding. Simultaneously, fine-grained amino acid sequence features and coarse-grained gene ontology attributes are introduced for multi-dimensional feature fusion. Finally, protein complexes are identified from the reweighted subnets based on fused feature representations using the core-attachment strategy. Evaluations on four real PPI datasets demonstrate that HGST achieves competitive performance. Furthermore, a series of biological analyses confirm the high biological significance of the complexes identified by HGST. The source code is available at https://github.com/qifen37/HGST.
- 22 November 2024
- Published by Oxford University Press (OUP) in Briefings in Bioinformatics
- Vol. 26 (1)
Open AccessMulti-source biological knowledge-guided hypergraph spatiotemporal subnetwork embedding for protein complex identification
Identifying biologically significant protein complexes from protein–protein interaction (PPI) networks and understanding their roles are essential for elucidating protein functions, life processes, and disease mechanisms. Current methods typically rely on static PPI networks and model PPI data as pairwise relationships, which presents several limitations. Firstly, static PPI networks do not adequately represent the scopes and temporal dynamics of protein interactions. Secondly, a large amount of available biological resources have not been fully integrated. Moreover, PPIs in biological systems are not merely one-to-one relationships but involve higher order non-pairwise interactions. To alleviate these issues, we propose HGST, a multi-source biological knowledge-guided hypergraph spatiotemporal subnetwork (subnet) embedding method for identifying biologically significant protein complexes from PPI networks. HGST initially constructs spatiotemporal PPI subnets using the scopes and temporal dynamics of proteins derived from multi-source biological knowledge, treating them as dynamic networks through fine-grained spatiotemporal partitioning. The spatiotemporal subnets are then transformed into hypergraphs, which model higher order non-pairwise relationships via hypergraph embedding. Simultaneously, fine-grained amino acid sequence features and coarse-grained gene ontology attributes are introduced for multi-dimensional feature fusion. Finally, protein complexes are identified from the reweighted subnets based on fused feature representations using the core-attachment strategy. Evaluations on four real PPI datasets demonstrate that HGST achieves competitive performance. Furthermore, a series of biological analyses confirm the high biological significance of the complexes identified by HGST. The source code is available at https://github.com/qifen37/HGST.
- 10 April 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 250
A meta-contrastive learning with data augmentation framework for zero-shot stance detection
- 10 April 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 250
A meta-contrastive learning with data augmentation framework for zero-shot stance detection