A differential approach to inference in Bayesian networks

Journal of the ACM

Volumn 50, Issue 3, 2003, Pages 280-305

  Darwiche, Adnan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bayesian networks; Circuit complexity; Compiling probabilistic models; Probabilistic reasoning

Indexed keywords

BAYESIAN NETWORKS; CIRCUIT COMPLEXITY; COMPILING PROBABILISTIC MODELS; PROBABILISTIC REASONING;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK ANALYSIS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILISTIC LOGICS; PROBLEM SOLVING; STATISTICS;

COMPUTER NETWORKS;

EID: 1642413218     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/765568.765570     Document Type: Article

References (30)

1. BODLAENDER, H. L. 1993. A tourist guide through treewidth. Acta Cybernetica 11, 1-2, 1-22.
2. BODLAENDER, H. L. 1996. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 6, 1305-1317.
3. BRYANT, R. E. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35, 677-691.
4. CASTILLO, E., GUTIÉRREZ, J. M., AND HADI, A. S. 1996. Goal oriented symbolic propagation in Bayesian networks. In Proceedings of the AAAI National Conference, pp. 1263-1268.
5. CASTILLO, E., GUTIÉRREZ, J. M., AND HADI, A. S. 1997. Sensitivity analysis in discrete Bayesian networks. IEEE Trans. Syst. Man, and Cybernetics 27, 412-423.
6. CHAN, H., AND DARWICHE, A. 2002. When do numbers really matter? J. Artif. Intel. Res. 17, 265-287.
7. COWELL, R., DAWID, A., LAURITZEN, S., AND SPIEGELHALTER, D. 1999. Probabilistic Networks and Expert Systems. Springer-Verlag, New York.
8. DARWICHE, A. 2001. Recursive conditioning. Artif. Intel. 126, 1-2, 5-41.
9. DARWICHE, A. 2002a. A compiler for deterministic, decomposable negation normal form. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI) (Memo Park, Calif.), AAAI Press, pp. 627-634.
10. DARWICHE, A. 2002b. A logical approach to factoring belief networks. In Proceedings of KR. pp. 409-420.
11. DARWICHE, A., AND MARQUIS, P. 2002. A knowlege compilation map. J. Artif. Intel. Res. 17, 229-264.
12. DECHTER, R. 1996. Bucket elimination: A unifying framework for probabilistic inference. In Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI). pp. 211-219.
13. HUANG, C., AND DARWICHE, A. 1996. Inference in belief networks: A procedural guide. Int. J. Approx. Reason. 15, 3, 225-263.
14. IRI, M. 1984. Simultaneous computation of functions, partial derivatives and estimates of rounding error. Japan J. Appl. Math. 1, 223-252.
15. JENSEN, F., AND ANDERSEN, S. K. 1990. Approximations in Bayesian belief universes for knowledge based systems. In Proceedings of the 6th Conference on Uncertainty in Artificial Intelligence (UAI) (Cambridge, Mass, July). pp. 162-169.
16. JENSEN, F. V. 1999. Gradient descent training of Bayesian networks. In Proceedings of the 5th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU). pp. 5-9.
17. JENSEN, F. V., LAURITZEN, S., AND OLESEN, K. 1990. Bayesian updating in recursive graphical models by local computation. Computat. Stat. Quart. 4, 269-282.
18. KJAERULFF, U., AND VAN DER GAAG, L. C. 2000. Making sensitivity analysis computationally efficient. In Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence (UAI).
19. LAURITZEN, S. L. 1995. The EM algorithm for graphical association models with missing data. Computat. Stat. Data Anal. 19, 191-201.
20. PARK, J. 2002. MAP complexity results and approximation methods. In Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence (UAI) (San Francisco, Calif.). Morgan Kaufmann, San Mateo, Calif., pp. 388-396.
21. PARK, J., AND DARWICHE, A. 2001. Approximating MAP using stochastic local search. In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence (UAI) (San Francisco, Calif.). Morgan-Kaufmann, San Mateo, Calif, pp. 403-410.
22. PARK, J., AND DARWICHE, A. 2002. A differential semantics for jointree algorithms. In Proceedings of the Symposium on Advances in Neural Information Processing Systems 15. MIT Press, Cambridge, Mass., pp. 299-307.
23. PEARL, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan-Kaufmann, San Mateo, Calif.
24. ROBERTSON, N., AND SEYMOUR, P. D. 1990. Graph minors IV. Tree-width and well-quasiordering. J. Combin. Theory Ser. B 48, 227-254.
25. RUSSELL, S., BINDER, J., KOLLER, D., AND KANAZAWA, K. 1995. Local learning in probabilistic networks with hidden variables. In Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence (UAI) (1995). pp. 1146-1152.
26. SAWYER, J. W. 1984. First partial differentiation by computer with an application to categorical data analysis. Amer. Stat. 38, 4, 300-308.
27. SHACHTER, R., D'AMBROSIO, B., AND DEL FAVERO, B. 1990. Symbolic Probabilistic Inference in Belief Networks. In Proceedings of the Conference on Uncertainty in AI. pp, 126-131.
28. SHENOY, P. P., AND SHAFER, G. 1986. Propagating belief functions with local computations. IEEE Expert 1, 3, 43-52.
29. VON ZUR GATHEN, J. 1988. Algebraic complexity theory. Ann. Rev. Comp. Sci. 3, 317-347.
30. ZHANG, N. L., AND POOLE, D. 1996. Exploiting causal independence in Bayesian network inference. J. Artif. Intel. Res. 5, 301-328.