Interpretable Graph Neural Networks for Heterogeneous Tabular Data

Amr Alkhatib, Henrik Boström
8/14/2024
cs.LG

No official code found. Best implementation: amrmalkhatib/IGNH (5 stars, MIT, last commit 2025-03-27).

Abstract

Many machine learning algorithms for tabular data produce black-box models, which prevent users from understanding the rationale behind the model predictions. In their unconstrained form, graph neural networks fall into this category, and they have further limited abilities to handle heterogeneous data. To overcome these limitations, an approach is proposed, called IGNH (Interpretable Graph Neural Network for Heterogeneous tabular data), which handles both categorical and numerical features, while constraining the learning process to generate exact feature attributions together with the predictions. A large-scale empirical investigation is presented, showing that the feature attributions provided by IGNH align with Shapley values that are computed post hoc. Furthermore, the results show that IGNH outperforms two powerful machine learning algorithms for tabular data, Random Forests and TabNet, while reaching a similar level of performance as XGBoost.

View on arXivView PDF

Code Implementations(1)

amrmalkhatib/IGNHCommunity100%
MIT
52Python, Jupyter NotebookFeb 23, 20241 years agoMIT

Similar Papers

Cite this paper

@article{alkhatib2024interpretable,
  title  = {Interpretable Graph Neural Networks for Heterogeneous Tabular Data},
  author = {Amr Alkhatib and Henrik Boström},
  year   = {2024},
  eprint = {2408.07661},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.07661v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.07661.svg)](https://codeofpaper.com/paper/2408.07661)

Discussion