Computational-Workload Based Binarization and Partition of Qualitative Markov Trees for Belief Combination
Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed two alternative methods to transform a qualitative Markov tree into a binary tree. In this paper, we present an alternative algorithm of transforming a qualitative Markov tree into a binary tree based on the computational workload in nodes for an exact implementation of evidence combination. A binary tree is then partitioned into clusters with each cluster being assigned to a processor in a parallel environment. These three types of binary trees are examined to reveal the structural and computational differences.
Unable to display preview. Download preview PDF.
- 1.Barnett, J.A.: Computational methods for a mathematical theory of evidence. In: Proc. of IJCAI 1981, Vancouver, BC, pp. 868–875 (1981)Google Scholar
- 5.Liu, W., Hong, X., Adamson, K.: Parallel implementation of evidence combination in qualitative Markov tress. Technical Report, University of UlsterGoogle Scholar
- 8.Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, San Mateo (1988)Google Scholar
- 12.Shenoy, P.: Binary join trees. In: Proc. of UAI 1996, pp. 492–499 (1996)Google Scholar
- 17.Wilson, N.: A Monte-Carlo algorithm for Dempster-Shafer belief. In: Proc. of UAI 1991, p. 414 (1991)Google Scholar