An exact approach to learning probabilistic relational model

Abstract : Probabilistic Graphical Models (PGMs) offer a popular framework including a variety of statistical formalisms, such as Bayesian networks (BNs). These latter are able to depict real-world situations with high degree of uncertainty. Due to their power and flexibility, several extensions were proposed, ensuring thereby the suitability of their use. Probabilistic Relational Models (PRMs) extend BNs to work with relational databases rather than propositional data. Their construction represents an active area since it remains the most complicated issue. Only few works have been proposed in this direction, and most of them don’t guarantee an optimal identification of their dependency structure. In this paper we intend to propose an approach that ensures returning an optimal PRM structure. It is inspired from a BN method whose performance was already proven.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download
Contributor : Philippe Leray <>
Submitted on : Wednesday, September 7, 2016 - 11:41:51 AM
Last modification on : Thursday, April 5, 2018 - 10:36:49 AM
Document(s) archivé(s) le : Thursday, December 8, 2016 - 1:10:58 PM


Publisher files allowed on an open archive


  • HAL Id : hal-01347804, version 1



Nourhene Ettouzi, Philippe Leray, Montassar Ben Messaoud. An exact approach to learning probabilistic relational model. 8th International Conference on Probabilistic Graphical Models (PGM 2016), 2016, Lugano, Switzerland. pp.171-182. ⟨hal-01347804⟩



Record views


Files downloads