Get access

Inference in Bayesian Networks with Recursive Probability Trees: Data Structure Definition and Operations

Authors


  • A preliminary version of this paper was presented at the CAEPIA’09 Conference.1

Author to whom all correspondence should be addressed; e-mail: acu@decsai.ugr.es.

Abstract

Recursive probability trees (RPTs) are a data structure for representing several types of potentials involved in probabilistic graphical models. The RPT structure improves the modeling capabilities of previous structures (like probability trees or conditional probability tables). These capabilities can be exploited to gain savings in memory space and/or computation time during inference. This paper describes the modeling capabilities of RPTs as well as how the basic operations required for making inference on Bayesian networks operate on them. The performance of the inference process with RPTs is examined with some experiments using the variable elimination algorithm.

Ancillary