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

Gengchen Wei

dblp:359/5856 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 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 · 75% Learning theory · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › statistical learning theory
bias-variance tradeoff
0.712023
Rethinking Semi-Supervised Imbalanced Node Classification from Bias-Variance Decomposition · NeurIPS 2023
Machine learning › Graph learning
graph neural network
0.712023
Rethinking Semi-Supervised Imbalanced Node Classification from Bias-Variance Decomposition · NeurIPS 2023
Machine learning › Graph learning › graph neural network › node classification
imbalanced node classification
0.712023
Rethinking Semi-Supervised Imbalanced Node Classification from Bias-Variance Decomposition · NeurIPS 2023
Machine learning › Graph learning › graph neural network
node classification
0.712023
Rethinking Semi-Supervised Imbalanced Node Classification from Bias-Variance Decomposition · NeurIPS 2023

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

regularization · 0.7graph augmentation · 0.7
YearPublicationVenuePosition
2023 Rethinking Semi-Supervised Imbalanced Node Classification from Bias-Variance Decomposition
abstract
This paper introduces a new approach to address the issue of class imbalance in graph neural networks (GNNs) for learning on graph-structured data. Our approach integrates imbalanced node classification and Bias-Variance Decomposition, establishing a theoretical framework that closely relates data imbalance to model variance. We also leverage graph augmentation technique to estimate the variance and design a regularization term to alleviate the impact of imbalance. Exhaustive tests are conducted on multiple benchmarks, including naturally imbalanced datasets and public-split class-imbalanced datasets, demonstrating that our approach outperforms state-of-the-art methods in various imbalanced scenarios. This work provides a novel theoretical perspective for addressing the problem of imbalanced node classification in GNNs.
Divin Yan, Gengchen Wei, Shengzhong Zhang, Zengfeng Huang
NeurIPS2