4.7 Article

Relational data embeddings for feature enrichment with background information

Journal

MACHINE LEARNING
Volume 112, Issue 2, Pages 687-720

Publisher

SPRINGER
DOI: 10.1007/s10994-022-06277-7

Keywords

Feature engineering; Feature enrichment; Knowledge graph embedding

Ask authors/readers for more resources

For many machine learning tasks, improving performance requires augmenting the data table with features derived from external sources. This study proposes replacing manually crafted features with vector representations of entities, such as cities, that capture relevant information. The research shows the importance of modeling entity relationships and capturing numerical attributes for creating effective feature vectors from relational data.
For many machine-learning tasks, augmenting the data table at hand with features built from external sources is key to improving performance. For instance, estimating housing prices benefits from background information on the location, such as the population density or the average income. However, this information must often be assembled across many tables, requiring time and expertise from the data scientist. Instead, we propose to replace human-crafted features by vectorial representations of entities (e.g. cities) that capture the corresponding information. We represent the relational data on the entities as a graph and adapt graph-embedding methods to create feature vectors for each entity. We show that two technical ingredients are crucial: modeling well the different relationships between entities, and capturing numerical attributes. We adapt knowledge graph embedding methods that were primarily designed for graph completion. Yet, they model only discrete entities, while creating good feature vectors from relational data also requires capturing numerical attributes. For this, we introduce KEN: Knowledge Embedding with Numbers. We thoroughly evaluate approaches to enrich features with background information on 7 prediction tasks. We show that a good embedding model coupled with KEN can perform better than manually handcrafted features, while requiring much less human effort. It is also competitive with combinatorial feature engineering methods, but much more scalable. Our approach can be applied to huge databases, creating general-purpose feature vectors reusable in various downstream tasks.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available