next up previous
Next: About this document Up: Exploiting Causal Independence in Previous: Proof of Theorem

References

1
S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embedding in a k-tree. SIAM J. Alg. Disc. Meth., 8(2):277--284, 1987.

2
M. Baker and T.E. Boult. Pruning Bayesian networks for efficient computation. In Proc. Sixth Conf. on Uncertainty in Artificial Intelligence, pages 257--264, Cambridge, Mass., 1990.

3
U. Bertelè and F. Brioschi. Nonserial dynamic programming, volume 91 of Mathematics in Science and Engineering. Academic Press, 1972.

4
C. Boutilier, N. Friedman, M. Goldszmidt, and D. Koller. Context-specific independence in Bayesian networks. In E. Horvitz and F. Jensen, editor, Proc. Twelthth Conf. on Uncertainty in Artificial Intelligence, pages 115--123, Portland, Oregon, 1996.

5
G. F. Cooper. The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence, 42(2-3):393--405, March 1990.

6
P. Dagum and A. Galper. Additive belief-network models. In D. Heckerman and A. Mamdani, editor, Proc. Ninth Conf. on Uncertainty in Artificial Intelligence, pages 91--98, Washington D.C., 1993.

7
D'Ambrosio. Local expression languages for probabilistic dependence. International Journal of Approximate Reasoning, 13(1):61--81, 1995.

8
B. D'Ambrosio. Symbolic probabilistic inference in large BN2O networks. In R. Lopez de Mantaras and D. Poole, editor, Proc. Tenth Conf. on Uncertainty in Artificial Intelligence, pages 128--135, Seattle, July 1994.

9
R. Dechter. Bucket elimination: A unifying framework for probabilistic inference. In E. Horvits and F. Jensen, editor, Proc. Twelthth Conf. on Uncertainty in Artificial Intelligence, pages 211--219, Portland, Oregon, 1996.

10
F. J. Díez. Parameter adjustment in bayes networks. the generalized noisy or-gate. In D. Heckerman and A. Mamdani, editor, Proc. Ninth Conf. on Uncertainty in Artificial Intelligence, pages 99--105, Washington D.C., 1993.

11
R. O. Duda, P. E. Hart, and N. J. Nilsson. Subjective Bayesian methods for rule-based inference systems. In Proc. AFIPS Nat. Comp. Conf., pages 1075--1082, 1976.

12
D. Geiger and D. Heckerman. Knowledge representation and inference in similarity networks and Bayesian multinets. Artificial Intelligence, 82:45--74, 1996.

13
D. Geiger, T. Verma, and J. Pearl. d-separation: from theorems to algorithms. In M. Henrion et. al., editor, Uncertainty in Artificial Intelligence 5, pages 139--148. North Holland, New York, 1990.

14
I. Good. A causal calculus (i). British Journal of Philosophy of Science, 11:305--318, 1961.

15
D. Heckerman. Causal independence for knowledge acquisition and inference. In Proc. of the Ninth Conference on Uncertainty in Artificial Intelligence, pages 122--127, 1993.

16
D. Heckerman and J. Breese. A new look at causal independence. In Proc. of the Tenth Conference on Uncertainty in Artificial Ingelligence, pages 286--292, 1994.

17
M. Henrion. Some practical issues in constructing belief networks. In L. Kanal and T. Levitt and J. Lemmer, editor, Uncertainty in Artificial Intelligence, pages 161--174. North-Holland, 1987.

18
R. A. Howard and J. E. Matheson. Influence diagrams. In R. A. Howard and J. Matheson, editors, The Principles and Applications of Decision Analysis, pages 720--762. Strategic Decisions Group, CA, 1981.

19
F. V. Jensen, S. L. Lauritzen, and K. G. Olesen. Bayesian updating in causal probabilistic networks by local computations. Computational Statistics Quaterly, 4:269--282, 1990.

20
J. Kim and J. Pearl. A computational model for causal and diagnostic reasoning in inference engines. In Proc. of the Eighth International Joint Conference on Artificial Intelligence, pages 190--193, Karlsruhe, Germany, 1983.

21
U. Kjærulff. Triangulation of graphs - algorithms giving small total state space. Technical Report R 90-09, Department of Mathematics and Computer Science, Strandvejen, DK 9000 Aalborg, Denmark, 1990.

22
S. L. Lauritzen, A. P. Dawid, B. N. Larsen, and H. G. Leimer. Independence properties of directed markov fields. Networks, 20:491--506, 1990.

23
S. L. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, Series B, 50(2):157--224, 1988.

24
Z. Li and B. D'Ambrosio. Efficient inference in Bayes networks as a combinatorial optimization problem. International Journal of Approximate Reasoning, 11(1):55--81, 1994.

25
K. G. Olesen and S. Andreassen. Specification of models in large expert systems based on causal probabilistic networks. Artificial Intelligence in Medicine, 5:269--281, 1993.

26
K. G. Olesen, U. Kjærulff, F. Jensen, B. Falck, S. Andreassen, and S. K. Andersen. A munin network for the median nerve - a case study on loops. Applied Artificial Intelligence, 3:384--403, 1989.

27
R.C. Parker and R.A. Miller. Using causal knowledge to creat simulated patient cases: the CPSC project as an extension of Internist-1. In Proc. 11th Symp. Comp. Appl. in Medical Care, pages 473--480, Los Alamitos, CA, 1987. IEEE Comp Soc Press.

28
J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA, 1988.

29
D. Poole. Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence, 64(1):81--129, 1993.

30
M. Pradhan, G. Provan, B. Middleton, and M. Henrion. Knowledge engineering for large belief networks. In R. Lopez de Mantaras and D. Poole, editor, Proc. Tenth Conf. on Uncertainty in Artificial Intelligence, pages 484--490, Seattle, July 1994.

31
R. D. Shachter, B. D. D'Ambrosio, and B. D. Del Favero. Symbolic probabilistic inference in belief networks. In Proc. 8th National Conference on Artificial Intelligence, pages 126--131, Boston, 1990. MIT Press.

32
G. Shafer and P. Shenoy. Probability propagation. Annals of Mathematics and Artificial Intelligence, 2:327--352, 1990.

33
E.H. Shortliffe and G. B. Buchanan. A model of inexact reasoning in medicine. Math. Biosci., 23:351--379, 1975.

34
S. Srinivas. A generalization of noisy-or model. In Proc. of the Ninth Conference on Uncertainty in Artificial Intelligence, pages 208--215, 1993.

35
R. E. Tarjan and M. Yannakakis. Simple linear time algorithm to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput., 13:566--579, 1984.

36
N. L. Zhang and D. Poole. A simple approach to Bayesian network computations. In Proc. of the Tenth Canadian Conference on Artificial Intelligence, pages 171--178, 1994.



David Poole
Fri Dec 6 15:09:32 PST 1996