• Aucun résultat trouvé

Relational Artificial Intelligence

N/A
N/A
Protected

Academic year: 2022

Partager "Relational Artificial Intelligence"

Copied!
1
0
0

Texte intégral

(1)

Relational Artificial Intelligence

Molham Aref

RelationalAI, USA molham.aref@gmail.com

In this talk, I will make the case for a first-principles approach to machine learning over relational databases that exploits recent development in database systems and theory. The input to learning classification and regression models is defined by feature extraction queries over relational databases. We cast the machine learning problem as a database problem by decomposing the learning task into a batch of aggregates over the feature extraction query and by com- puting this batch over the input database. The performance of this approach benefits tremendously from structural properties of the relational data and of the feature extraction query; such properties may be algebraic (semi-ring), com- binatorial (hypertree width), or statistical (sampling). This translates to several orders-of-magnitude speed-up over state-of-the-art systems. This work is based on collaboration with Hung Q. Ngo (RelationalAI), Mahmoud Abo-Khamis (Re- lationalAI), Ryan Curtin (RelationalAI), Dan Olteanu (Oxford), Maximilian Schleich (Oxford), Ben Moseley (CMU), and XuanLong Nguyen (Michigan) and other members of the RelationalAI team and faculty network.

Références

Documents relatifs

Les fibres de carbone possèdent de très bonnes caractéristiques mécaniques d’autant plus leur masse volumique est faible ( généralement inférieure à 2000 kg /m3) ,le

Quelques réflexions sur les modèles : stratégies de conception, formes mathématiques, hypothèses théoriques, généralisation. Journées CAQ Croissance Amélioration Qualité des

The algorithm for this “direct” optimization is based on a proximal gradient descent and it has been derived by casting the dictionary learning problem into a recent non-convex

In the present work, we propose training different ML models on a large number of previously solved instances of the ALP, so as to obtain an estimate of the lowest cost of the subset

With an efficient solver for QUBO and the Ising model at hand, solving a specific optimization problem reduces to finding an efficient embedding into the domain of n-dimensional

Any set of models created by machine learning algorithms represents information inherited in the underlying training data and can therefore be considered a knowledge base.. In

This section is specifically designed for the original method. However, such format cannot be efficiently used as output label because it would have to be parsed. Each leaf is

And this is where machine learning can be useful, offering a series of techniques to define a sample of informal leaders similar to the Bureau nominees without having to explicitly