.png){kind=icon}
.png){kind=icon}
Return
Edge-updating graph neural networks for modeling feature interactions in tabular data
.png){kind=icon}
OA
AI
P
C
B
DOI：10.1016/j.neunet.2026.108724.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Graph neural network
Tabular data
Feature interactions
Edge features
Deep learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
7.7K
Citations:
3.0W
Organization
Cited Papers