Mitigating Class Imbalance in Graph-Structured Data via Hierarchical Learning: Insights from Protein Binding Site Prediction
Paiva, V.; Marcolino, L.; Izidoro, S.; Silveira, S.
Show abstract
Learning from imbalanced data remains a major challenge for graph neural networks (GNNs), as minority nodes are not only rare but also structurally marginalized within the graph. We address this issue with CLARA, a hierarchical learning framework that decomposes node classification into two stages: a coarse subgraph-level classifier that selects regions likely to contain minority instances, followed by a fine-grained node-level predictor within these regions. This design improves sensitivity while maintaining scalability, filtering out irrelevant areas and focusing learning on topologically meaningful neighborhoods. Experiments on benchmark graph datasets demonstrate substantial gains over established imbalance-handling methods, with CLARA reaching an F1-score of 88.3\%. The same strategy achieves significant improvements in protein-ligand binding site prediction, underscoring its broad and consistent effectiveness across both biological and general graph learning tasks.
Matching journals
The top 6 journals account for 50% of the predicted probability mass.
Similar papers in this journal
Similar papers in this journal
- Combined topological data analysis and geometric deep learning reveal niches by the quantification of protein binding pockets 92%
- Building explainable graph neural network by sparse learning for the drug-protein binding prediction 91%
- Gromov-Wasserstein optimal transport to align single-cell multi-omics data 91%
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.