Name
Abstract | ||
|---|---|---|
Feature engineering is one of the most important but tedious tasks in data science projects. This work studies automation of feature learning for relational data. We first theoretically proved that learning relevant features from relational data for a given predictive analytics problem is NP-hard. However, it is possible to empirically show that an efficient rule based approach predefining transformations as a priori based on heuristics can extract very useful features from relational data. Indeed, the proposed approach outperformed the state of the art solutions with a significant margin. We further introduce a deep neural network which automatically learns appropriate transformations of relational data into a representation that predicts the target variable well instead of being predefined as a priori by users. In an extensive experiment with Kaggle competitions, the proposed methods could win late medals. To the best of our knowledge, this is the first time an automation system could win medals in Kaggle competitions with complex relational data. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Artificial Intelligence | Rule-based system,Process automation system,Relational database,Computer science,Predictive analytics,Heuristics,Feature engineering,Artificial intelligence,Artificial neural network,Feature learning,Machine learning |
DocType | Volume | Citations |
Journal | abs/1801.05372 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hoang Thanh Lam | 1 | 0 | 1.01 |
| Ngoc Minh Tran | 2 | 59 | 5.08 |
| Mathieu Sinn | 3 | 55 | 10.41 |
| Beat Buesser | 4 | 1 | 2.41 |
| Martin Wistuba | 5 | 154 | 19.66 |