pith. machine review for the scientific record. sign in

arxiv: 1801.05372 · v4 · submitted 2018-01-16 · 💻 cs.AI · cs.LG

Recognition: unknown

Neural Feature Learning From Relational Database

Authors on Pith no claims yet
classification 💻 cs.AI cs.LG
keywords relationaldatadatabasefeatureapproachcompetitionsfeaturesfirst
0
0 comments X
read the original abstract

Feature engineering is one of the most important but most tedious tasks in data science. This work studies automation of feature learning from relational database. We first prove theoretically that finding the optimal features from relational data for predictive tasks is NP-hard. We propose an efficient rule-based approach based on heuristics and a deep neural network to automatically learn appropriate features from relational data. We benchmark our approaches in ensembles in past Kaggle competitions. Our new approach wins late medals and beats the state-of-the-art solutions with significant margins. To the best of our knowledge, this is the first time an automated data science system could win medals in Kaggle competitions with complex relational database.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. From Schema to Signal: Retrieval-Augmented Modeling for Relational Data Analytics

    cs.DB 2026-05 unverdicted novelty 7.0

    RAM augments relational graph models with attribute-semantic retrieval via random-walk documents and two contrastive augmentations (ATRA, ETRA) to achieve state-of-the-art results on five real-world databases.