Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering

Artificial Intelligence

Volumn 170, Issue 16-17, 2006, Pages 1137-1174

  Mengshoel, Ole J ^a   Wilkins, David C ^b   Roth, Dan ^c  

^a NASA AMES RESEARCH CENTER   (United States)

^b STANFORD UNIVERSITY   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

Bayesian networks; C V ratio; Controlled experiments; Maximal clique size; Probabilistic reasoning; Random generation; Tree clustering inference

Indexed keywords

ALGORITHMS; CONTROLLABILITY; GRAPH THEORY; LEARNING SYSTEMS; PARAMETER ESTIMATION; PROBABILITY; RANDOM PROCESSES;

BAYESIAN NETWORKS; CONTROLLED EXPERIMENTS; MAXIMAL CLIQUE SIZE; PROBABILISTIC REASONING; RANDOM GENERATION; TREE CLUSTERING INFERENCE;

TELECOMMUNICATION NETWORKS;

EID: 33750631759     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2006.09.003     Document Type: Article

References (72)

1. Abdelbar A.M., and Hedetnieme S.M. Approximating MAPs for belief networks is NP-hard and other theorems. Artificial Intelligence 102 (1998) 21-38
2. S.K. Andersen, K.G. Olesen, F.V. Jensen, F. Jensen, HUGIN-a shell for building Bayesian belief universes for expert systems, in: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, vol. 2, Detroit, MI, August 1989, pp. 1080-1085
3. S. Andreassen, M. Woldbye, B. Falck, S.K. Andersen, MUNIN-A causal probabilistic network for interpretation of electromyographic findings, in: Proceedings of the Tenth International Joint Conference on Artificial Intelligence, Milan, Italy, August 1987, pp. 366-372
4. Angluin D., and Valiant L.G. Fast probabilistic algorithms for Hamiltonian circuits and matchings. Journal of Computer and System Sciences 18 2 (1979) 155-193
5. Arnborg S. Efficient algorithms for combinatorial problems on graphs with bounded decomposability-a survey. BIT 25 (1985) 2-23
6. Arnborg S., Corneil D.G., and Proskurowski A. Complexity of finding embeddings in a k-tree. SIAM Journal of Algebraic and Discrete Methods 8 (1987) 277-284
7. A. Becker, D. Geiger, Approximation algorithms for the loop cutset problem, in: Proceedings of the Tenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-94), San Francisco, CA, 1994, pp. 60-68
8. Bertele U., and Brioschi F. Nonserial Dynamic Programming (1972), Academic Press, New York
9. Bobbio A., Portinale L., Minichino M., and Ciancamerla E. Improving the analysis of dependable systems by mapping fault trees into Bayesian networks. Reliability Engineering and System Safety 71 3 (2001) 249-260
10. Chater N., and Manning C.D. Probabilistic models of language processing and acquisition. Trends in Cognitive Sciences 10 7 (2006) 335-344
11. P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are, in: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, Sidney, Australia, 1991, pp. 331-337
12. M. Ciaramita, M. Johnson, Explaining away ambiguity: Learning verb selectional preference with Bayesian networks, in: 18th International Conference on Computational Linguistics (COLING-00), Saarbrücken, Germany, 2000, pp. 187-193
13. Clark D., Frank J., Gent I., MacIntyre E., Tomov N., and Walsh T. Local search and the number of solutions. Proceedings of the Second International Conference on Principles and Practices of Constraint Programming. Lecture Notes in Computer Science vol. 1118 (1996), Springer, Berlin 119-133
14. Cooper F.G. The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence 42 (1990) 393-405
15. P. Crescenzi, V. Kann, A compendium of NP optimization problems, Technical Report SI/RR-95/02, Dipartimento di Scienze dell'Informazione, Universita di Roma "La Sapienza", Roma, Italy, 1995
16. A. Darwiche, Conditioning methods for exact and approximate inference in causal networks, in: Proceedings of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence (UAI-95), Montreal, Canada, 1995, pp. 99-107
17. Darwiche A. Recursive conditioning. Artificial Intelligence 126 12 (2001) 5-41
18. Dawid A.P. Applications of a general propagation algorithm for probabilistic expert systems. Statistics and Computing 2 (1992) 25-36
19. Dechter R. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113 1-2 (1999) 41-85
20. Dechter R., and El Fattah Y. Topological parameters for timespace tradeoff. Artificial Intelligence 125 1-2 (2001) 93-118
21. Dechter R., and Pearl J. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence 34 1 (1987) 1-38
22. Diez F.J. Local conditioning in Bayesian networks. Artificial Intelligence 87 1-2 (1996) 1-20
23. G.A. Dirac, Some theorems on abstract graphs, in: Proc. London Math. Soc. 2 (1952) 69-81
24. Hugin Expert. Hugin API: Reference Manual (2004), Hugin Expert
25. Franco J., and Paull M. Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. Discrete Applied Mathematics 5 (1983) 77-87
26. Frank J., Cheeseman P., and Stutz J. When gravity fails: Local search topology. Journal of Artificial Intelligence Research 7 (1997) 249-281
27. Frey B.J. Graphical Models for Machine Learning and Digital Communication (1998), MIT Press, Cambridge, MA
28. Gallager R.G. Low density parity check codes. IRE Transactions on Information Theory 8 (1962) 21-28
29. Ge X., Eppstein D., and Smyth P. The distribution of loop lengths in graphical models for turbo decoding. IEEE Transactions on Information Theory 47 6 (2001) 2549-2553
30. Gu P.W., Purdom J., Franco J., and Wah B.W. Algorithms for the satisfiability SAT problem: A survey. Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1997), American Mathematical Society, Providence, RI 19-152
31. Henrion M. Search-based methods to bound diagnostic probabilities in very large belief networks. Proceedings of the Seventh Annual Conference on Uncertainty in Artificial Intelligence (UAI-91) (1991), University of California at Los Angeles, CA 142-150
32. Horvitz E.J., Suermondt H.J., and Cooper G.F. Bounded conditioning: Flexible inference for decisions under scarce resources. Proceedings of the Fifth Conference on Uncertainty in Artificial Intelligence (UAI-89). Windsor, Ontario (1989), Morgan Kaufmann 182-193
33. Huang C., and Darwiche A. Inference in belief networks: A procedural guide. International Journal of Approximate Reasoning 15 (1996) 225-263
34. J.S. Ide, F.G. Cozman, Generating random Bayesian networks, in: Proceedings on 16th Brazilian Symposium on Artificial Intelligence, Porto de Galinhas, Brazil, November 2002, pp. 366-375
35. J.S. Ide, F.G. Cozman, F.T. Ramos, Generating random Bayesian networks with constraints on induced width, in: Proceedings of the 16th European Conference on Artificial Intelligence, 2004, pp. 323-327
36. Jackson W. Hamilton cycles in regular 2-connected graphs. Journal of Combinatorial Theory Series B 29 (1980) 27-46
37. Jensen F.V. An Introduction to Bayesian Networks (1996), Springer, New York
38. Jensen F.V., Lauritzen S.L., and Olesen K.G. Bayesian updating in causal probabilistic networks by local computations. SIAM Journal on Computing 4 (1990) 269-282
39. Jensen F.V., Olesen K.G., and Andersen S.K. An algebra of Bayesian belief universes for knowledge-based systems. Networks 20 5 (1990) 637-659
40. P. Jones, C. Hayes, D. Wilkins, R. Bargar, J. Sniezek, P. Asaro, O.J. Mengshoel, D. Kessler, M. Lucenti, I. Choi, N. Tu, J. Schlabach, CoRAVEN: Modeling and design of a multimedia intelligent infrastructure for collaborative intelligence analysis, in: Proceedings of the International Conference on Systems, Man, and Cybernetics, San Diego, CA, October 1998, pp. 914-919
41. Kask K., and Dechter R. Stochastic local search for Bayesian networks. Proceedings Seventh International Workshop on Artificial Intelligence and Statistics. Fort Lauderdale, FL (January 1999), Morgan Kaufmann
42. Kjaerulff U. Optimal decomposition of probabilistic networks by simulated annealing. Statistics and Computing 2 (1992) 7-17
43. Kononenko I. Inductive and Bayesian learning in medical diagnosis. Applied Artificial Intelligence 7 (1993) 317-337
44. Koster A.M.C.A., Bodlaender H.L., and van Hoesel S.P.M. Treewidth: Computational experiments. In: Broersma H., Faigle U., Hurink J., and Pickl S. (Eds). Electronic Notes in Discrete Mathematics vol. 8 (2001), Elsevier Science Publishers, Amsterdam
45. Langseth H., and Portinale L. Bayesian networks in reliability. Reliability Engineering and System Safety 92 1 (2007) 92-108
46. Lauritzen S., and Spiegelhalter D.J. Local computations with probabilities on graphical structures and their application to expert systems (with discussion). Journal of the Royal Statistical Society Series B 50 2 (1988) 157-224
47. Li Z., and D'Ambrosio B. Efficient inference in Bayes nets as a combinatorial optimization problem. International Journal of Approximate Reasoning 11 1 (1994) 55-81
48. M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi, D.A. Spielman, Improved low-density parity-check codes using irregular graphs and belief propagation, in: International Symposium on Information Theory, Cambridge, MA, August 1998
49. MacKay D.J.C. Information Theory, Inference and Learning Algorithms (2002), Cambridge University Press, Cambridge, UK
50. A. Madsen, Computing MPEs in Hugin. Personal communication, April 2003
51. O.J. Mengshoel, Efficient Bayesian network inference: Genetic algorithms, stochastic local search, and abstraction, PhD thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, April 1999
52. O.J. Mengshoel, D. Roth, D.C. Wilkins, Hard and easy Bayesian networks for computing the most probable explanation, Technical Report UIUCDCS-R-2000-2147, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, January 2000
53. O.J. Mengshoel, D. Roth, D.C. Wilkins, Stochastic greedy search: Computing the most probable explanation in Bayesian networks, Technical Report UIUCDCS-R-2000-2150, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, February 2000
54. Mengshoel O.J., and Wilkins D.C. Raven: Bayesian networks for human-computer intelligent interaction. In: Vassiliou M.S., and Huang T.S. (Eds). Computer Science Handbook for Displays (2001), Rockwell Scientific Company 209-219
55. D. Mitchell, B. Selman, H.J. Levesque, Hard and easy distributions of SAT problems, in: Proceedings of the Tenth National Conference on Artificial Intelligence, San Jose, CA, 1992, pp. 459-465
56. J.D. Park, A. Darwiche, Approximating MAP using local search, in: Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (UAI-01), Seattle, WA, 2001, pp. 403-410
57. Pearl J. A constraint-propagation approach to probabilistic reasoning. In: Kanal L.N., and Lemmer J.F. (Eds). Uncertainty in Artificial Intelligence (1986), Elsevier, Amsterdam 357-369
58. Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (1988), Morgan Kaufmann, San Mateo, CA
59. Robertson N., and Seymour P. Graph minors. ii. Algorithmic aspects of treewidth. Journal of Algorithms 7 (1986) 309-322
60. Roth D. On the hardness of approximate reasoning. Artificial Intelligence 82 (1996) 273-302
61. C.C. Ruokangas, O.J. Mengshoel, Information filtering using Bayesian networks: effective user interfaces for aviation weather data, in: Proceedings of the 2003 International Conference on Intelligent User Interfaces, Miami, FL, 2003, pp. 280-283
62. B. Selman, H.A. Kautz, B. Cohen, Noise strategies for improving local search, in: Proceedings of the Twelfth National Conference on Artificial Intelligence, Seattle, WA, 1994, pp. 337-343
63. B. Selman, H. Levesque, D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings of the Tenth National Conference on Artificial Intelligence, San Jose, CA, July 1992, pp. 440-446
64. R.D. Shachter, S.K. Andersen, P. Szolovits. Global conditioning for probabilistic inference in belief networks, in: Proceedings of the Tenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-94), Seattle, WA, 1994, pp. 514-522
65. Shenoy P.P. A valuation-based language for expert systems. International Journal of Approximate Reasoning 5 3 (1989) 383-411
66. Shimony E. Finding MAPs for belief networks is NP-hard. Artificial Intelligence 68 (1994) 399-410
67. Shwe M.A., Middleton B., Heckerman D.E., Henrion M., Horvitz E.J., Lehmann H.P., and Cooper G.F. Probabilistic diagnosis using a reformulation of the INTERNIST-1/QMR knowledge base: I. The probabilistic model and inference algorithms. Methods of Information in Medicine 30 4 (1991) 241-255
68. C. Skaaning Jensen, A. Kong, Blocking Gibbs sampling for linkage analysis in large pedigrees with many loops, Research Report R-96-2048, Department of Computer Science, Aalborg University, Denmark, 1996
69. Suermondt H.J., and Cooper G.F. Probabilistic inference in multiply connected belief networks using loop cutsets. International Journal of Approximate Reasoning 4 (1990) 283-306
70. R.L. Welch, Real time estimation of Bayesian networks, in: Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence (UAI-96), Portland, OR, 1996, pp. 533-544
71. Yokoo M. Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs. Proceedings of the Third International Conference on Principles and Practice of Constraint Programming. Lecture Notes in Computer Science vol. 1330 (1997), Springer, Berlin 357-370
72. Zhang N.L., and Poole D. Exploiting causal independence in Bayesian network inference. Journal of Artificial Intelligence Research 5 (1996) 301-328