Abstract
A number of representation systems have been proposed that extend the purely propositional Bayesian network paradigm with representation tools for some types of first-order probabilistic dependencies. Examples of such systems are dynamic Bayesian networks and systems for knowledge based model construction. We can identify the representation of probabilistic relational models as a common well-defined semantic core of such systems.
Recursive relational Bayesian networks (RRBNs) are a framework for the representation of probabilistic relational models. A main design goal for RRBNs is to achieve greatest possible expressiveness with as few elementary syntactic constructs as possible. The advantage of such an approach is that a system based on a small number of elementary constructs will be much more amenable to a thorough mathematical investigation of its semantic and algorithmic properties than a system based on a larger number of high-level constructs. In this paper we show that with RRBNs we have achieved our goal, by showing, first, how to solve within that framework a number of non-trivial representation problems. In the second part of the paper we show how to construct from a RRBN and a specific query, a standard Bayesian network in which the answer to the query can be computed with standard inference algorithms. Here the simplicity of the underlying representation framework greatly facilitates the development of simple algorithms and correctness proofs. As a result we obtain a construction algorithm that even for RRBNs that represent models for complex first-order and statistical dependencies generates standard Bayesian networks of size polynomial in the size of the domain given in a specific application instance.
Similar content being viewed by others
References
F. Bacchus, Representing and Reasoning with Probabilistic Knowledge (MIT Press, Cambridge, MA, 1990).
M. Baker and T.E. Boult, Pruning Bayesian networks for efficient computation, in: Uncertainty in Artificial Intelligence, Vol. 6, eds. P.P. Bonissone, M. Henrion, L.N. Kanal and J.F. Lemmer (Elsevier Science, Amsterdam, 1991) pp. 225-232.
R.B. Boppana and M. Sipser, The complexity of finite functions, in: Handbook of Theoretical Computer Science (Elsevier Science, Amsterdam, 1990).
C. Boutilier, N. Friedman, M. Goldszmidt and D. Koller, Context-specific independence in Bayesian networks, in: Proceedings of the 12th Annual Conference on Uncertainty in Artificial Intelligence (UAI-96), Portland, Oregon (1996) pp. 115-123.
J.S. Breese, Construction of belief and decision networks, Computational Intelligence 8(4) (1992) 624-647.
G.F. Cooper, The computational complexity of probabilistic inference using Bayesian belief networks, Artificial Intelligence 42 (1990) 393-405.
P. Dagum, A. Galper and E. Horvitz, Dynamic network models for forecasting, in: Proceedings of the 8th Annual Conference on Uncertainty in Artificial Intelligence (UAI-92) (Morgan Kaufmann, San Francisco, CA, 1992) pp. 41-48.
N. Friedman, L. Getoor, D. Koller and A. Pfeffer, Learning probabilistic relational models, in: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99) (1999).
A. Frieze and C. McDiarmid, Algorithmic theory of random graphs, Random Structures & Algorithms 10 (1997) 5-42.
F.V. Jensen, An Introduction to Bayesian Networks (UCL Press, 1996).
P. Haddawy, Generating Bayesian networks from probability logic knowledge bases, in: Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence (UAI-94) (1994) pp. 262-269.
J.Y. Halpern, An analysis of first-order logics of probability, Artificial Intelligence 46 (1990) 311-350.
T. Huang, D. Koller, J. Malik, G. Ogasawara, B. Rao, S. Russell and J. Weber, Automatic symbolic traffic scene analysis using belief networks, in: Proceedings of the 12th National Conference on Artificial Intelligence (1994) pp. 966-972.
M. Jaeger, Relational Bayesian networks, in: Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence (UAI-97) (1997).
M. Jaeger, Convergence results for relational Bayesian networks, in: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98) (1998).
M. Jaeger, Reasoning about infinite random structures with relational Bayesian networks, in: Principles of Knowledge Representation and Reasoning: Proceedings of the 6th International Conference (KR'98) (1998) pp. 570-581.
M. Jaeger, On the complexity of inference about probabilistic relational models, Artificial Intelligence 117 (2000) 297-308.
V.M. Khrapchenko, The complexity of the realization of symmetrical functions by formulae, Mathematical Notes of the Academy of Sciences of the USSR 11(1) (1972) 70-76.
D. Koller and A. Pfeffer, Probabilistic frame-based systems, in: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) (1998) pp. 580-587.
L. Ngo and P. Haddawy, Answering queries from context-sensitive probabilistic knowledge bases, Theoretical Computer Science 171 (1997) 147-177.
A.E. Nicholson and J.M. Brady, Dynamic belief networks for discrete monitoring, IEEE Systems, Man and Cybernetics 24(11) (1994) 1593-1610.
J. Pearl, Fusion, propagation and structuring in belief networks, Artificial Intelligence 29 (1986) 241-288.
J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, The Morgan Kaufmann Series in Representation and Reasoning (Morgan Kaufmann, San Mateo, CA, 2nd revised edition, 1988).
D. Poole, Probabilistic horn abduction and Bayesian networks, Artificial Intelligence 64 (1993) 81-129.
A. Saffiotti and E. Umkehrer, Inference-driven construction of valuation systems from first-order clauses, IEEE Transactions on Systems, Man, and Cybernetics 24(11) (1994) 1611-1624.
H.J. Suermondt and G.F. Cooper, Probabilistic inference in multiply connected belief networks using loop cutsets, International Journal of Approximate Reasoning 4 (1990) 283-306.
M.P.Wellman, J.S. Breese and R.P. Goldman, From knowledge bases to decision models, The Knowledge Engineering Review 7(1) (1992) 35-53.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jaeger, M. Complex Probabilistic Modeling with Recursive Relational Bayesian Networks. Annals of Mathematics and Artificial Intelligence 32, 179–220 (2001). https://doi.org/10.1023/A:1016713501153
Issue Date:
DOI: https://doi.org/10.1023/A:1016713501153