DAPER joint learning from partially structured Graph Databases - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

DAPER joint learning from partially structured Graph Databases


In this paper, we are interested in learning specific proba-bilistic relational models, named Directed Acyclic Probabilistic Entity Relationship (DAPER) models, from partially structured databases. Algorithms for such a learning task already exist for structured data coming from a relational database. They have been also extended to partially structured data stored in a graph database where the Entity Relationship (ER) schema is first identified from data, and then the DAPER dependency structure is learnt for this specific ER schema. We propose in this work a joint learning from partially structured graph databases where we want to learn at the same time the ER schema and the proba-bilistic dependencies. The Markov Logic Network (MLN) formalism is an efficient solution for this task. We show with an illustrative example that MLN structure learning can effectively learn both parts of the DAPER model in one single task, with a comparative precision, but with a very high complexity.
Fichier principal
Vignette du fichier
Marwa_El_Abri_ICDEc_2018.pdf (595.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01804057 , version 1 (09-04-2020)



Marwa El Abri, Philippe Leray, Nadia Essoussi. DAPER joint learning from partially structured Graph Databases. Third annual International Conference on Digital Economy (ICDEc 2018), 2018, Brest, France. pp.129-138, ⟨10.1007/978-3-319-97749-2_10⟩. ⟨hal-01804057⟩
139 View
60 Download



Gmail Facebook X LinkedIn More