Class-Imbalanced Graph Learning without Class Rebalancing
원문 초록
Class imbalance is prevalent in real-world node classification tasks and poses great challenges for graph learning models. Most existing studies are rooted in a class-rebalancing (CR) perspective and address class imbalance with class-wise reweighting or resampling. In this work, we approach the root cause of class-imbalance bias from an topological paradigm. Specifically, we theoretically reveal two fundamental phenomena in the graph topology that greatly exacerbate the predictive bias stemming from class imbalance. On this basis, we devise a lightweight topological augmentation framework BAT to mitigate the class-imbalance bias without class rebalancing. Being orthogonal to CR, BAT can function as an efficient plug-and-play module that can be seamlessly combined with and significantly boost existing CR techniques. Systematic experiments on real-world imbalanced graph learning tasks show that BAT can deliver up to 46.27% performance gain and up to 72.74% bias reduction over existing techniques. Code, examples, and documentations are available at https://github.com/ZhiningLiu1998/BAT.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark
Scalable Graph Generative Modeling via Substructure Sequences
Graph Semi-Supervised Learning for Point Classification on Data Manifolds
Devil's Hand: Data Poisoning Attacks to Locally Private Graph Learning Protocols
Message-Passing State-Space Models: Improving Graph Learning with Modern Sequence Modeling
EC-LDA : Label Distribution Inference Attack against Federated Graph Learning with Embedding Compression
토론
이 논문과 연결된 포럼 글이 아직 없습니다.