Exact and approximate inference in ProBT

Revue d'Intelligence Artificielle

Volumn 21, Issue 3, 2007, Pages 295-331

  Mekhnacha, Kamel ^a   Ahuactzin, Juan Manuel ^a   Bessière, Pierre ^b   Mazer, Emmanuel ^a   Smail, Linda ^c  

^a ProBayes   (France)

^b INRIA RHÔNE ALPES   (France)

^c UNIVERSITÉ GUSTAVE EIFFEL   (France)

Author keywords

Approximate inference; Bayesian networks; Exact inference; Optimization

Indexed keywords

APPROXIMATION THEORY; BAYESIAN NETWORKS; COMPUTER SIMULATION; MONTE CARLO METHODS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS;

APPROXIMATE INFERENCE; EXACT INFERENCE;

INFERENCE ENGINES;

EID: 34548201777     PISSN: 0992499X     EISSN: None     Source Type: Journal    
DOI: 10.3166/ria.21.295-332     Document Type: Article

References (45)

1. Arnborg S., Proskurowski A., " Linear time algorithms for NP-hard problems restricted to partial k-trees", Discrete and Applied Mathematics, vol. 23, n°1, p. 11-24, 1989.
2. Becker A., Geiger D., " A sufficiently fast algorithm for finding close to optimal clique trees", Artificial Intelligence, vol. 125, n° 1-2, p. 3-17, 2001.
3. Box G. E. P., Muller M. E., Annals Math. Stat., vol. 29, chapter A note on the generation of random normal deviates, p. 610-611, 1958.
4. Cooper G., "The computational complexity of probabilistic inference using Bayesian belief networks", Artificial Intelligence, vol. 42, p. 393-405, 1990.
5. Corana A., Martini C., Ridella S., "Minimizing Multimodal Functions of Continuous Variables with the' Simulated Annealing' Algorithm", ACM Transactions on Mathematical Software, vol. 13, p. 262-280, 1987.
6. Cowell R. G., Dawid A. P., Lauritzen S. L., Spiegelhalter D. J., Probabilistic Networks and Expert Systems, 1999.
7. D'Ambrosio B., Shachter R. D., DelFavero B. A., " Symbolic probabilistic inference in belief networks", Proc. of AAAI'90, p. 126-131, 1990.
8. Darwiche A., " Recursive Conditioning", Artificial Intelligence, vol. 126, n° 1-2, p. 5-41, 2001.
9. Darwiche A., Prován G., " Query DAGs: A Practical Paradigm for Implementing Belief Network Inference", J. Artif. Intellig. Res. (JAIR), vol. 6, p. 147-176, 1997.
10. Dechter R., "Bucket elimination: A unifying framework for probabilistic inference", in E. Horvits, F. Jensen (eds), Proc. of the Twelveth Conf. on Uncertainty in Artificial Intelligence, Portland, Oregon, p. 211-219, 1996.
11. Dechter R., " Bucket elimination: A unifying framework for probabilistic inference", Artificial Intelligence, vol. 113, n° 1-2, p. 41-85, 1999.
12. Dellaert F., Fox D., Burgard W., Thrun S., " Monte Carlo localization for mobile robots", Proc. of the IEEE Int. Conf on Robotics and Automation, Detroit, MI, May, 1999.
13. Eyal A., " Efficient approximation for triangulation of minimum treewidth", Proc. of Uncertainty in Artificial Intelligence (UAI'17), p. 7-15, 2001.
14. Fox D., Burgard W., Dellaert F., Thrun S., " Monte Carlo Localization: Efficient Position Estimation for Mobile Robots", Proc. of the Sixteenth National Conference on Artificial Intelligence (AAAI'99), 1999.
15. Geman S., Geman D., "Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images", IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, p. 721-741, 1984.
16. Geweke J., " Monte Carlo simulation and numerical integration", in H. Amman, D. Kendrick, J. Rust (eds), Handbook of Computational Economics, vol. 13, Elsevier North-Holland, Amsterdam, p. 731-800, 1996.
17. Holland J. H., Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.
18. Jaakkola T. S., Jordan M. I., "Variational probabilistic inference and the QMR-DT network", J. Artif. Intellig. Res. (JAIR), vol. 10, p. 291-322, 1999.
19. Jensen F, An Introduction to Bayesian Networks, UCL Press, 1996.
20. Jensen F., Bayesian Networks and Decision Graphs, Statistics for Engineering and Information Science, Springer, 2001.
21. Jordan M., Weiss Y., " Graphical models: Probabilistic inference", in M. Arbib (ed.), The Handbook of Brain Theory and Neural Networks, MIT Press, Amsterdam, 2002.
22. Keller A., "The fast calculation of form factors using low discrepancy point sequence", Proc. of the 12th Spring Conf. on Computer Graphics, Bratislava, p. 195-204, 1996.
23. Kjaerulff U., Triangulation of graphs - algorithms giving small total state space, Technical Report no R 90-09, Dept. of Mathematics and Computer Science, Aalborg University, 1990.
24. Lauritzen S. L., Spiegelhalter D. J., " Local computations with probabilities on graphical structures and their applications to expert systems", Proc. of the Royal Statistical Society, n 50 in B, p. 154-227, 1988.
25. Li Z., D'Ambrosio B., " Efficient Inference in Bayes Networks As A Combinatorial Optimization Problem", Int. J. of Approximate Reasoning, vol. 11, p. 55-81, 1994.
26. MacKay D. G. C., " Introduction to Monte Carlo Methods", Proc. of an Erice summer school, ed. M.Jordan, 1996.
27. Madsen A. L., Jensen F. V., " Lazy propagation in junction trees", Proc. of the Fourteenth Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann Publishers, p. 362-369, 1998.
28. Mazer E., Ahuactzin J. M., Bessière P., " The Ariadne's Clew algorithm", J. Artif. Intellig. Res. (JAIR), vol. 9, p. 295-316, 1998.
29. Mekhnacha K., Mazer E., Bessière P., " A Robotic CAD system using a Bayesian framework", Proc. of the IEEE/RSJ Int. Conf. on Intelligent Robots and Systems (IROS 2000), vol. 3, Takamatsu, Japan, p. 1597-1604, October, 2000.
30. Mekhnacha K., Mazer E., Bessière P., " The design and implementation of a Bayesian CAD modeler for robotic applications", Advanced Robotics, the Int. J. of the Robotics Society of Japan, vol. 15, no 1, p. 45-70, 2001.
31. Metropolis N., Rosenblusth A. W., Rosenblusth M. N., Teller A., Teller E., "Equation of state by fast computing machines", Journal of Chemical Physics, vol. 21, p. 1087-1092, 1953.
32. Neal R. M., Probabilistic inference using Markov Chain Monte Carlo methods, Research Report no CRG-TR-93-1, Dept. of Computer Science, University of Toronto, 1993.
33. Park J., " MAP complexity results and approximation methods", Proc. of the 17th Conference on Uncertainty in ArticialIntelligence (UAI), p. 388-396, 2002.
34. Pearl J., " Reverand Bayes on inference engines: A distributed hierarchical approach", Proc. of the AAAINational Conference on AI, Pittsburgh, p. 133-136, 1982.
35. Pearl J., Probabilistic reasoning in intelligent systems: networks of plausible inference, Morgan Kaufmann, San Mateo, California, 1988.
36. Reed B. A., "Finding approximate separators and computing tree width quicly", Proc. of the 24th Annual ACMSymposium on the Theory of Computing, p. 221-229, 1992.
37. Robertson N., Seymour P. D., " Graph minors. XIII. The disjoint paths problem", Journal of Combinatorial Theory, vol. 63, no B, p. 65-110, 1995.
38. Rose D. J., " Triangulated graphs and the elimination process", Journal of Mathematical Analysis and Applications, vol. 32, no 3, p. 597-609, 1970.
39. Rubinstein R. Y., Simulation and the Monte Carlo method, John Wiley and Sons, 1981.
40. Shenoy P., Shafer G., Uncertainty in Al, vol. 4, R. Shachter et al, chapter Axioms for Probability and Belief-Function Propagation, 1990.
41. Shokhet K., Geiger D., " A practical algorithm for finding optimal triangulations", Proc. of AAAI'97, p. 187-190, 1997.
42. Smail L., Algorithmique pour les Réseaux Bayésiens et leurs Extensions, Thèse de doctorat, Université de Marne-La- Valée, France, April, 2004.
43. Smith A. F., Roberts G. O., " Bayesian computation via the Gibbs sampler and related Monte Carlo methods", Journal of the Royal Statistical Society B, vol. 55, p. 3-23, 1993.
44. Yuan C., Druzdzel M. J., " Importance Sampling Algorithms for Bayesian Networks: Principles and Performance", Mathematical and Computer Modeling, vol. 43, p. 1189-1207, 2006.
45. Zhang N. L., Poole D., " A simple approach to Bayesian network computations", Proc. of the Tenth Canadian Conference on Artificial Intelligence, p. 171-178, 1994.