From Features to Structure: Task-Aware Graph Construction for Relational and Tabular Learning with GNNs

Tamara Cucumides, Floris Geerts
6/2/2025
cs.LG

No confident code implementation found for this paper.

Abstract

Tabular and relational data remain the most ubiquitous formats in real-world machine learning applications, spanning domains from finance to healthcare. Although both formats offer structured representations, they pose distinct challenges for modern deep learning methods, which typically assume flat, feature-aligned inputs. Graph Neural Networks (GNNs) have emerged as a promising solution by capturing structural dependencies within and between tables. However, existing GNN-based approaches often rely on rigid, schema-derived graphs -- such as those based on primary-foreign key links -- thereby underutilizing rich, predictive signals in non key attributes. In this work, we introduce auGraph, a unified framework for task-aware graph augmentation that applies to both tabular and relational data. auGraph enhances base graph structures by selectively promoting attributes into nodes, guided by scoring functions that quantify their relevance to the downstream prediction task. This augmentation preserves the original data schema while injecting task-relevant structural signal. Empirically, auGraph outperforms schema-based and heuristic graph construction methods by producing graphs that better support learning for relational and tabular prediction tasks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{cucumides2025from,
  title  = {From Features to Structure: Task-Aware Graph Construction for Relational and Tabular Learning with GNNs},
  author = {Tamara Cucumides and Floris Geerts},
  year   = {2025},
  eprint = {2506.02243},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.02243v1}
}

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/2506.02243.svg)](https://codeofpaper.com/paper/2506.02243)

Discussion