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

Bisheng Li

dblp:318/2783 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0001-9341-0495ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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.

Artificial intelligence
1 paper
Graph learning · 76% Learning paradigms · 19% Trustworthy machine learning · 6%
Databases, data mining, and information retrieval
1 paper
Data mining · 56% Knowledge graphs · 44%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
class imbalance
0.912025
Geometric Imbalance in Semi-Supervised Node Classification · NeurIPS 2025
Machine learning › Graph learning
graph neural network
0.912025
Geometric Imbalance in Semi-Supervised Node Classification · NeurIPS 2025
Machine learning › Graph learning › graph neural network
message passing
0.912025
Geometric Imbalance in Semi-Supervised Node Classification · NeurIPS 2025
Machine learning › Graph learning › graph neural network
node classification
0.912025
Geometric Imbalance in Semi-Supervised Node Classification · NeurIPS 2025
Machine learning › Graph learning › graph neural network › node classification
semi-supervised node classification
0.912025
Geometric Imbalance in Semi-Supervised Node Classification · NeurIPS 2025
Data mining › structured data mining
graph mining
0.612022
BSAL: A Framework of Bi-component Structure and Attribute Learning for Link Prediction · SIGIR 2022
Knowledge graphs
link prediction
0.612022
BSAL: A Framework of Bi-component Structure and Attribute Learning for Link Prediction · SIGIR 2022
Machine learning › Trustworthy machine learning
fairness
0.312025
Geometric Imbalance in Semi-Supervised Node Classification · NeurIPS 2025
Data mining › representation learning
graph representation learning
0.212022
BSAL: A Framework of Bi-component Structure and Attribute Learning for Link Prediction · SIGIR 2022

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

riemannian manifold analysis · 0.9pseudo-label alignment · 0.9node reordering · 0.9ambiguity filtering · 0.9structural and attribute learning · 0.6attention mechanism · 0.6
YearPublicationVenuePosition
2025 Geometric Imbalance in Semi-Supervised Node Classification
abstract
Class imbalance in graph data presents a significant challenge for effective node classification, particularly in semi-supervised scenarios. In this work, we formally introduce the concept of geometric imbalance, which captures how message passing on class-imbalanced graphs leads to geometric ambiguity among minority-class nodes in the riemannian manifold embedding space. We provide a rigorous theoretical analysis of geometric imbalance on the riemannian manifold and propose a unified framework that explicitly mitigates it through pseudo-label alignment, node reordering, and ambiguity filtering. Extensive experiments on diverse benchmarks show that our approach consistently outperforms existing methods, especially under severe class imbalance. Our findings offer new theoretical insights and practical tools for robust semi-supervised node classification.
Shengzhong Zhang, Bisheng Li, Menglin Yang 0001, Min Zhou 0006, Weiyang Ding, Yutong Xie 0001, Zengfeng Huang
NeurIPS3
2025 Graph Batch Coarsening framework for scalable graph neural networks
Shengzhong Zhang, Bisheng Li, Wenjie Yang 0006, Min Zhou 0006, Zengfeng Huang
Neural Networks3
2022 BSAL: A Framework of Bi-component Structure and Attribute Learning for Link Prediction
abstract
Given the ubiquitous existence of graph-structured data, learning the representations of nodes for the downstream tasks ranging from node classification, link prediction to graph classification is of crucial importance. Regarding missing link inference of diverse networks, we revisit the link prediction techniques and identify the importance of both the structural and attribute information. However, the available techniques either heavily count on the network topology which is spurious in practice, or cannot integrate graph topology and features properly. To bridge the gap, we propose a bicomponent structural and attribute learning framework (BSAL) that is designed to adaptively leverage information from topology and feature spaces. Specifically, BSAL constructs a semantic topology via the node attributes and then gets the embeddings regarding the semantic view, which provides a flexible and easy-to-implement solution to adaptively incorporate the information carried by the node attributes. Then the semantic embedding together with topology embedding are fused together using attention mechanism for the final prediction. Extensive experiments show the superior performance of our proposal and it significantly outperforms baselines on diverse research benchmarks.
Bisheng Li, Min Zhou 0006, Shengzhong Zhang, Menglin Yang 0001, Defu Lian, Zengfeng Huang
SIGIR1