GNN efficiency evaluation for node classification across multi-domain datasets with different noise conditions

Node classification in graph data is critical for selecting the optimal algorithm. In this study, we analyze different datasets with various Graph Neural Network (GNN) models to evaluate node classification accuracy. The primary goal is to identify efficient methods for multi-domain datasets that can outperform other approaches. We selected 14 different datasets from various domains for our experiment. To find an effective solution for node classification, we explored 10 GNN models for accuracy comparison. Each model was tested with different settings, and the best-performing model was selected. We compared the node classification accuracy for each model. Next, we adopted a resilience-checking approach to find the best models that perform well under different noise conditions. We employed three different strategies: Gaussian, label, and edge-level noise to assess the ability of different models in node classification. The experimental results show that some models demonstrate superior capacity in node classification, including SAGEConv, ChebConv, and H2GCN. SAGEConv shows superior resilience against noise whereas ChebConv has good node classification accuracy.

Authors

Institutions

Publication Details

Journal
Ain Shams Engineering Journal
Published
2026-11-06
DOI
https://doi.org/10.1016/j.asej.2026.104515
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

GNN efficiency evaluation for node classification across multi-domain datasets with different noise conditions

Hyoung‐Kyu Song, Md Habibur Rahman, Md Abdul Aziz, Mohammad Abrar Shakil Sejan et al.
Ain Shams Engineering Journal
Advanced Graph Neural Networks
article

GNN efficiency evaluation for node classification across multi-domain datasets with different noise conditions

Hyoung‐Kyu Song, Md Habibur Rahman, Md Abdul Aziz, Mohammad Abrar Shakil Sejan, Iqra Hameed, Shariar Md Imtiaz, Nidal Nasser, Md Shofiqul Islam
article en

Abstract

Node classification in graph data is critical for selecting the optimal algorithm. In this study, we analyze different datasets with various Graph Neural Network (GNN) models to evaluate node classification accuracy. The primary goal is to identify efficient methods for multi-domain datasets that can outperform other approaches. We selected 14 different datasets from various domains for our experiment. To find an effective solution for node classification, we explored 10 GNN models for accuracy comparison. Each model was tested with different settings, and the best-performing model was selected. We compared the node classification accuracy for each model. Next, we adopted a resilience-checking approach to find the best models that perform well under different noise conditions. We employed three different strategies: Gaussian, label, and edge-level noise to assess the ability of different models in node classification. The experimental results show that some models demonstrate superior capacity in node classification, including SAGEConv, ChebConv, and H2GCN. SAGEConv shows superior resilience against noise whereas ChebConv has good node classification accuracy.

Ain Shams Engineering JournalVol. 17(12)
Alfaisal University (SA), Deakin University (AU), Sejong University (KR)
National Research Foundation of Korea, Ministry of Science and ICT, South Korea, Institute for Information and Communications Technology Promotion
Openalex Percentile: Top 19%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon