Temporary registration page before publication by Linköping University Electronic Press, series Computer and Information Science
The following article is intended to be published shortly by Linköping University Electronic Press. The present page gives access to the article, but does not provide the guarantees of persistence.

Relational Bayesian Networks, a Survey.

Title:Relational Bayesian Networks, a Survey.
Authors: Manfred Jaeger
Series:Linköping Electronic Articles in Computer and Information Science
ISSN 1401-9841
Issue:Vol. 7(2002): nr 015
URL: http://www.ep.liu.se/ea/cis/2002/015/

Abstract: Relational Bayesian networks are a highly expressive representation language for probability distributions on relational structures. Distinguishing features of this framework are syntactic simplicity (the language is defined by only four elementary syntactic constructs loosely corresponding to the constructs of predicate logic) and semantic clarity. In this paper I give an overview over relational Bayesian networks. First syntax, semantics and inference methods for elementary queries are recapitulated, then I will highlight some of the more challenging topics that arise when one asks non-elementary queries about probabilities for infinite structures, or limit probabilities for finite structures of increasing size. Finally, I will briefly discuss the question of learning relational Bayesian networks from data.

Intended publication
Postscript Checksum
Info from authors  
Third-party information  

[About LiEP] [About Checksum validation] [About compression formats]

Editor-in-chief: editor@ep.liu.se
Webmaster: webmaster@ep.liu.se