MDTE: Minority-Aware Diffusion over Temporal Edge Events for Imbalanced Node Classification
Organizations: Zhejiang University of Technology Hangzhou, China · The University of Sydney Sydney, Australia · Vecton AI Australia
Abstract
Class-imbalanced node classification on temporal graphs is challenging because majority-dominated temporal propagation progressively assimilates minority representations, while conventional node and neighborhood information provides insufficient discriminative evidence for minority classes. To address these issues, we propose MDTE, a minority-aware diffusion framework that reconstructs stable and discriminative temporal edge-event representations through conditional diffusion denoising. Specifically, MDTE introduces Distribution-Aware Selective Propagation, which combines Local Outlier Factor (LOF)-based propagation filtering with cluster-aware low-frequency propagation. The module preserves informative neighborhood dependencies while mitigating harmful propagation and majority-class information assimilation. It further develops Multi-View Discriminative Fusion, which exploits feature reconstruction and topology prediction to characterize class-wise differences in distribution learning and extracts complementary discriminability signals to guide denoising. Experiments on five real-world datasets demonstrate that MDTE consistently achieves the best performance on minority-class-oriented metrics, improving minority-class recall by up to 23.53 percentage points, minority-class F1 by 8.68 percentage points, and AUPRC by 2.67 percentage points over the strongest baselines.
Figures & tables
| Dataset | Nodes | Temporal edges | Minority | Majority | IR |
|---|---|---|---|---|---|
| DGraph-Fin | 3,700,550 | 4,300,999 | 15,509 | 1,210,092 | 78.03 |
| Elliptic | 203,769 | 234,355 | 4,545 | 42,019 | 9.25 |
| Elliptic++ Transactions | 203,769 | 234,355 | 4,545 | 42,019 | 9.25 |
| Elliptic++ Actors | 822,942 | 2,868,964 | 14,266 | 251,088 | 17.60 |
| Ethereum | 2,973,489 | 13,551,303 | 1,165 | 2,972,324 | 2,551.35 |
| Dataset | Metric | TGC | DyGFormer | TGAT | TGN | GraphPAE | DGMAE | GraphSMOTE | LTE4G | GraphENS | DDM | SDMG | LGD | TGAT+Conda | MDTE |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| DGraph-Fin | AUROC | ||||||||||||||
| AUPRC | |||||||||||||||
| Recall-min. | |||||||||||||||
| F1-min. | |||||||||||||||
| Macro-F1 | |||||||||||||||
| Elliptic | AUROC |
| Variant | DGraph-Fin | Elliptic | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| AUROC | AUPRC | Recall-min. | F1-min. | Macro-F1 | AUROC | AUPRC | Recall-min. | F1-min. | Macro-F1 | |
| w/o Temporal Edge-Event Construction | 75.54 0.12 | 3.52 0.09 | 41.35 3.54 | 6.79 0.18 | 49.69 0.02 | 97.77 0.11 | 91.83 0.24 | 83.99 1.51 | 85.59 0.30 | 92.10 0.56 |
| w/o Distribution-Aware Selective Propagation | 80.64 0.23 | 4.57 0.08 | 50.88 3.34 | 8.11 0.07 | 49.68 0.00 | 98.11 0.09 | 93.13 0.13 | 85.00 1.11 | 86.71 0.48 | 92.85 0.56 |
| w/o Multi-View Discriminative Fusion | 80.90 0.29 | 4.67 0.06 | 53.44 0.99 | 8.08 0.04 | 49.71 0.02 | 97.93 0.18 | 92.35 0.50 | 83.96 1.92 | 86.29 0.41 | 92.91 0.39 |
| w/o Debiased Contrastive Learning | 81.01 0.39 | 4.71 0.19 | 50.07 7.76 | 8.09 0.05 | 49.69 0.02 | 97.75 0.14 | 91.63 0.18 | 83.34 1.25 | 86.04 0.66 | 92.31 0.38 |
| Full Model | 81.19 0.23 | 4.76 0.07 | 55.54 0.95 | 8.24 0.10 | 49.72 0.06 | 98.21 0.06 | 93.61 0.15 | 86.44 0.37 | 88.54 0.31 | 93.68 0.17 |
Node Classification
Node classification assigns labels to graph entities by combining their features with information from connected nodes and graph structure.
See all 100 papers