Relational Bayesian Networks

Abstract

A new method is developed to represent probabilistic relations on multiple random events. Where previously knowledge bases containing probabilistic rules were used for this purpose, here a probability distribution over the relations is directly represented by a Bayesian network. By using a powerful way of specifying conditional probability distributions in these networks, the resulting formalism is more expressive than the previous ones. Particularly, it provides for constraints on equalities of events, and it allows to define complex, nested combination functions.

Appears in Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI1997)

Cited by in corpus (17)

• Loglinear models for first-order probabilistic reasoning
• Relational Dynamic Bayesian Networks
• Location-Based Reasoning about Complex Multi-Agent Behavior
• Representing Conversations for Scalable Overhearing
• Probabilistic Programming Concepts
• Inference, Learning, and Population Size: Projectivity for SRL Models
• Probabilistic Complex Event Recognition: A Survey
• CP-logic: A Language of Causal Probabilistic Events and Its Relation to Logic Programming
• On the relative asymptotic expressivity of inference frameworks
• Why is Compiling Lifted Inference into a Low-Level Language so Effective?
• Learning from networked examples
• Complexity Analysis and Variational Inference for Interpretation-based Probabilistic Description Logic
• The Complexity of Bayesian Networks Specified by Propositional and Relational Languages
• Dynamic Bayesian Ontology Languages
• Propositional and Relational Bayesian Networks Associated with Imprecise and Qualitative Probabilistic Assesments
• Probabilities of the Third Type: Statistical Relational Learning and Reasoning with Relative Frequencies
• Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops