Edge-updating graph neural networks for modeling feature interactions in tabular data

We proposed a message-passing graph neural network (GNN) based on graph isomorphism network (GIN) for learning on tabular data. Fully-connected, unweighted feature graphs were constructed from tabular data using contextual feature encodings for numerical and categorical features. A classification node was added to the feature graph to represent the entire graph during inference. Feature interactions were modeled using the proposed architecture, which used a neural network to learn edge attributes while leveraging residual connections for both node and edge updates to alleviate oversmoothing, a commonly-faced problem in GNNs. Our model was evaluated on 12 publicly available datasets and achieved the best mean rank among 6 tabular deep learning and GNN models. Furthermore, since gradient-boosted decision trees are considered to be state-of-the-art models for tabular data, we compared our model to XGBoost and CatBoost and found that our model outperformed both models in all datasets when using default hyperparameters and achieved the best results in 8 datasets when using tuned hyperparameters. A further comparison was made against 5 commonly used or recently-proposed GNNs to investigate the effectiveness of our model, in which our model achieved the top result in all datasets.

Authors

Institutions

Publication Details

Journal
Neural Networks
Published
2026-02-15
DOI
https://doi.org/10.1016/j.neunet.2026.108724
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Edge-updating graph neural networks for modeling feature interactions in tabular data

Pimwipa Charuthamrong, Binh P. Nguyen, Colin R. Simpson
Neural Networks
Advanced Graph Neural Networks
article

Edge-updating graph neural networks for modeling feature interactions in tabular data

Pimwipa Charuthamrong, Binh P. Nguyen, Colin R. Simpson
article en

Abstract

We proposed a message-passing graph neural network (GNN) based on graph isomorphism network (GIN) for learning on tabular data. Fully-connected, unweighted feature graphs were constructed from tabular data using contextual feature encodings for numerical and categorical features. A classification node was added to the feature graph to represent the entire graph during inference. Feature interactions were modeled using the proposed architecture, which used a neural network to learn edge attributes while leveraging residual connections for both node and edge updates to alleviate oversmoothing, a commonly-faced problem in GNNs. Our model was evaluated on 12 publicly available datasets and achieved the best mean rank among 6 tabular deep learning and GNN models. Furthermore, since gradient-boosted decision trees are considered to be state-of-the-art models for tabular data, we compared our model to XGBoost and CatBoost and found that our model outperformed both models in all datasets when using default hyperparameters and achieved the best results in 8 datasets when using tuned hyperparameters. A further comparison was made against 5 commonly used or recently-proposed GNNs to investigate the effectiveness of our model, in which our model achieved the top result in all datasets.

Neural NetworksVol. 199
University of Auckland (NZ), Auckland University of Technology (NZ), Victoria University of Wellington (NZ)
Peace, Justice and strong institutions
Openalex Percentile: Top 57%
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.