Learning Models over Relational Data using Sparse Tensors and Functional Dependencies
This paper developed the theoretical foundation of discriminative learning over relational data, showing how one can exploit the relational structures in the data and the feature extraction query to speed up model training.
Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich. 2020.
In ACM Transactions on Database Systems (TODS ‘20). Vol. 45 No. 2, Article 7.
Integrated solutions for analytics over relational databases are of great practical importance as they avoid the costly repeated loop data scientists have to deal with on a daily basis: select features from data residing in relational databases using feature extraction queries involving joins, projections, and aggregations; export the training dataset defined by such queries; convert this dataset into the format of an external learning tool; and train the desired model using this tool. These integrated solutions are also a fertile ground of theoretically fundamental and challenging problems at the intersection of relational and statistical data models.
Read the PDF: Learning Models over Relational Data using Sparse Tensors and Functional Dependencies (opens in a new tab)
Related Posts
PlutoCon 2021 - Reactive Notebooks
At RelationalAI, we believe relational knowledge graphs are the foundation for future data-centric systems, and we are excited to demo the reactive notebook environment we built for working with knowledge graphs here with you!
A Layered Aggregate Engine for Analytics Workloads
Recommender systems are an integral part of eCommerce services, helping to optimize revenue and user satisfaction. Bundle recommendation has recently gained attention by the research community since behavioral data supports that users often buy more than one product in a single transaction. In most cases, bundle recommendations are of the form “users who bought product A also bought products B, C, and D”. Although such recommendations can be useful, there is no guarantee that products A,B,C, and D may actually be related to each other. In this paper, we address the problem of collection recommendation, i.e., recommending a collection of products that share a common theme and can potentially be purchased together in a single transaction.