Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fanding Xu

dblp:308/9762 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0001-7220-8693ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
protein function prediction
0.912025
PRING: Rethinking Protein-Protein Interaction Prediction from Pairs to Graphs · NeurIPS 2025
Bioinformatics and computational biology
protein-protein interaction prediction
0.912025
PRING: Rethinking Protein-Protein Interaction Prediction from Pairs to Graphs · NeurIPS 2025
Machine learning › Graph learning › graph neural network
graph-level task
0.312025
PRING: Rethinking Protein-Protein Interaction Prediction from Pairs to Graphs · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

structure-based prediction · 1.7sequence similarity · 1.7protein language model · 1.7
YearPublicationVenuePosition
2025 PRING: Rethinking Protein-Protein Interaction Prediction from Pairs to Graphs
abstract
Deep learning-based computational methods have achieved promising results in predicting protein-protein interactions (PPIs). However, existing benchmarks predominantly focus on isolated pairwise evaluations, overlooking a model's capability to reconstruct biologically meaningful PPI networks, which is crucial for biology research. To address this gap, we introduce PRING, the first comprehensive benchmark that evaluates PRotein-protein INteraction prediction from a Graph-level perspective. PRING curates a high-quality, multi-species PPI network dataset comprising 21,484 proteins and 186,818 interactions, with well-designed strategies to address both data redundancy and leakage. Building on this golden-standard dataset, we establish two complementary evaluation paradigms: (1) topology-oriented tasks, which assess intra and cross-species PPI network construction, and (2) function-oriented tasks, including protein complex pathway prediction, GO module analysis, and essential protein justification. These evaluations not only reflect the model's capability to understand the network topology but also facilitate protein function annotation, biological module detection, and even disease mechanism analysis. Extensive experiments on four representative model categories, consisting of sequence similarity-based, naive sequence-based, protein language model-based, and structure-based approaches, demonstrate that current PPI models have potential limitations in recovering both structural and functional properties of PPI networks, highlighting the gap in supporting real-world biological applications. We believe PRING provides a reliable platform to guide the development of more effective PPI prediction models for the community. The dataset and source code of PRING are available at https://github.com/SophieSarceau/PRING.
Xinzhe Zheng 0001, Fanding Xu, Jinzhe Li, Zhiyuan Liu 0001, Wenkang Wang, Tao Chen 0003, Wanli Ouyang, Stan Z. Li, Yan Lu 0001, Nanqing Dong, Yang Zhang 0094
NeurIPS3
2024 MESPool: Molecular Edge Shrinkage Pooling for hierarchical molecular representation learning and property prediction
abstract
Identifying task-relevant structures is important for molecular property prediction. In a graph neural network (GNN), graph pooling can group nodes and hierarchically represent the molecular graph. However, previous pooling methods either drop out node information or lose the connection of the original graph; therefore, it is difficult to identify continuous subtructures. Importantly, they lacked interpretability on molecular graphs. To this end, we proposed a novel Molecular Edge Shrinkage Pooling (MESPool) method, which is based on edges (or chemical bonds). MESPool preserves crucial edges and shrinks others inside the functional groups and is able to search for key structures without breaking the original connection. We compared MESPool with various well-known pooling methods on different benchmarks and showed that MESPool outperforms the previous methods. Furthermore, we explained the rationality of MESPool on some datasets, including a COVID-19 drug dataset.
Fanding Xu, Zhiwei Yang 0003, Lizhuo Wang, Deyu Meng, Jiangang Long
Briefings Bioinform.1