Cooperative triangulation in MSBNs without revealing subnet structures

Networks

Volumn 37, Issue 1, 2001, Pages 53-65

  Xiang, Y ^a  

^a UNIVERSITY OF GUELPH   (Canada)

Author keywords

Approximate reasoning; Bayesian networks; Chordal graph; Cooperation and coordination; Distributed computation; Graph theory; Multiagent systems; Multiply sectioned Bayesian networks; Triangulation

Indexed keywords

EID: 0035219369     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200101)37:1<53::AID-NET5>3.0.CO;2-H     Document Type: Article

References (10)

1. [1] M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
2. [2] F.V. Jensen, An introduction to Bayesian networks, UCL Press, 1996.
3. [3] D. Koller and A. Pfeffer, Object-oriented Bayesian networks. Proc 13th Conf on Uncertainty in Artificial Intelligence, D. Geiger and P.P. Shenoy (Editors), Providence, RI, 1997, pp. 302-313.
4. [4] J. Pearl, Probabilistic reasoning in intelligent systems: Networks of plausible inference, Morgan Kaufmann, 1988.
5. [5] Y. Xiang, Optimization of inter-subnet belief updating in multiply sectioned Bayesian networks. Proc 11th Conf on Uncertainty in Artificial Intelligence, Montreal, 1995, pp. 565-573.
6. [6] Y. Xiang, A probabilistic framework for cooperative multiagent distributed interpretation and optimization of communication, Artif Intell 87(1-2) (1996), 295-342.
7. [7] Y. Xiang, Belief updating in MSBNs without repeated local propagations, Technical report CS-98-01, University of Regina, 1998.
8. [8] Y. Xiang, B. Pant, A. Eisen, M.P. Beddoes, and D. Poole, Multiply sectioned Bayesian networks for neuromuscular diagnosis, Artif Intell Med 5 (1993), 293-314.
9. [9] Y. Xiang, D. Poole, and M.P. Beddoes, Multiply sectioned Bayesian networks and junction forests for large knowledge based systems, Comput Intell 9 (1993), 171-220.
10. [10] M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J Alg Discr Methods 2 (1981).