Graph augmentations effectively enhance the robustness and generalization of Graph Neural Networks (GNNs), particularly for graph classification tasks. However, existing augmentation methods, like NodeDrop, randomly drop a certain portion of nodes to generate augmented graphs without preserving the essential topological structures of the original graph, potentially modifying label information. To address this issue, we introduce a novel Node-Dropping Augmentation (NDAUG) method for graph classification tasks. Our method leverages node degree as a criterion to selectively drop less important nodes (low-degree) and preserve essential graph structures, generating diverse and informative augmented graphs. Further, in the case of isolated nodes, we develop a structure learning method to reconnect these isolated nodes by learning attention-based relationships between nodes. Experiments demonstrate that combining the proposed NDAUG with existing GNN models yields an average improvement of 2-5% accuracy on eight graph classification benchmarks compared to the state-of-the-art baselines.

Topology-Aware Node Dropping Augmentation for Graph Classification

Ali, Waqar;Vascon, Sebastiano;Pelillo, Marcello
2026

Abstract

Graph augmentations effectively enhance the robustness and generalization of Graph Neural Networks (GNNs), particularly for graph classification tasks. However, existing augmentation methods, like NodeDrop, randomly drop a certain portion of nodes to generate augmented graphs without preserving the essential topological structures of the original graph, potentially modifying label information. To address this issue, we introduce a novel Node-Dropping Augmentation (NDAUG) method for graph classification tasks. Our method leverages node degree as a criterion to selectively drop less important nodes (low-degree) and preserve essential graph structures, generating diverse and informative augmented graphs. Further, in the case of isolated nodes, we develop a structure learning method to reconnect these isolated nodes by learning attention-based relationships between nodes. Experiments demonstrate that combining the proposed NDAUG with existing GNN models yields an average improvement of 2-5% accuracy on eight graph classification benchmarks compared to the state-of-the-art baselines.
2026
2026 6th International Conference on Neural Networks, Information and Communication Engineering, NNICE 2026
File in questo prodotto:
File Dimensione Formato  
Topology-Aware_Node_Dropping_Augmentation_for_Graph_Classification.pdf

non disponibili

Tipologia: Versione dell'editore
Licenza: Accesso chiuso-personale
Dimensione 2.3 MB
Formato Adobe PDF
2.3 MB Adobe PDF   Visualizza/Apri

I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10278/5120009
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact