An Exact Approach to Learning Probabilistic Relational Model

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.

• Publication year

  2016

• Venue

  European Workshop on Probabilistic Graphical Models

• Publication date

  2016-08-15

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Probabilistic relational models : learning and evaluation : The relational Bayesian networks case

  2015cited by this paper
• Learning Optimal Bayesian Networks: A Shortest Path Perspective

  2013influential reference
• Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks

  2013cited by this paper
• Learning optimal Bayesian networks with heuristic search

  2012cited by this paper
• Learning Optimal Bayesian Networks Using A* Search

  2011cited by this paper
• Efficient Structure Learning of Bayesian Networks using Constraints

  2011cited by this paper
• Bayesian network learning with cutting planes

  2011cited by this paper
• Learning Causal Models of Relational Domains

  2010cited by this paper
• Finding optimal control policy in Probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming

  2010cited by this paper
• AWA* - A Window Constrained Anytime Heuristic Search Algorithm

  2007cited by this paper
• Introduction to Statistical Relational Learning

  2007cited by this paper
• Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks

  2005cited by this paper
• Learning Probabilistic Models of Relational Structure

  2001cited by this paper
• Probabilistic reasoning for complex systems

  1999cited by this paper
• Probabilistic Frame-Based Systems

  1998cited by this paper
• Learning from Data: Artificial Intelligence and Statistics V

  1996cited by this paper
• Learning Bayesian Networks is

  1994cited by this paper
• A Bayesian method for the induction of probabilistic networks from data

  1992cited by this paper
• Heuristics : intelligent search strategies for computer problem solving

  1984influential reference
• A Formal Basis for the Heuristic Determination of Minimum Cost Paths

  1968cited by this paper

• EXTENDING RELATIONAL DATABASE MODEL FOR UNCERTAIN INFORMATION

  2019influential citation
• DAPER Joint Learning from Partially Structured Graph Databases

  2018cites this paper
• Qualitative Probabilistic Relational Models

  2018cites this paper
• Learning Probabilistic Relational Models with (Partially Structured) Graph Databases

  2017cites this paper
• Learning Probabilistic Relational Models Using an Ontology of Transformation Processes

  2017cites this paper