Macroscopic models of clique tree growth for bayesian networks

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1256-1262

  Mengshoel, Ole J ^a  

^a NASA AMES RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE BAYESIAN NETWORKS; GROWTH CURVES; ROOT NODES; TREE SIZE GROWTH;

BAYESIAN NETWORKS; BENCHMARKING; CLUSTERING ALGORITHMS; MATHEMATICAL MODELS;

TREES (MATHEMATICS);

EID: 36348943444     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Andersen, S. K.; Olesen, K. G.; Jensen, F. V.; and Jensen, F. 1989. HUGIN - a shell for building Bayesian belief universes for expert systems. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, volume 2, 1080-1085.
2. Arnborg, S.; Corneil, D. G.; and Proskurowski, A. 1987. Complexity of finding embeddings in a fc-tree. SIAM Journal of Algebraic and Discrete Meththods 8:277-284.
3. Banks, R. B. 1994. Growth and Diffusion Phenomena. New York: Springer.
4. Darwiche, A. 2001. Recursive conditioning. Artificial Intelligence 126(1-2):5-41.
5. Dechter, R., and Fattah, Y. E. 2001. Topological parameters for time-space tradeoff. Artificial Intelligence 125(1-2):93-118.
6. Dechter, R., and Pearl, J. 1987. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence 34(1): 1-38.
7. Ide, J. S.; Cozman, F. G.; and Ramos, F. T. 2004. Generating random Bayesian networks with constraints on induced width. In Proceedings of the 16th European Conference on Artificial Intelligence, 323-327.
8. Koster, A. M. C. A.; Bodlaender, H. L.; and van Hoesel, S. P. M. 2001. Treewidth: Computational experiments. In Broersma, H.; Faigle, U.; Hurink, J.; and Pickl, S., eds., Electronic Notes in Discrete Mathematics, volume 8. Elsevier Science Publishers.
9. Lauritzen, S., and Spiegelhalter, D. J. 1988. 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): 157-224.
10. Lindsey, J. K. 2004. Statistical Analysis of Stochastic Processes in Time. Cambridge: Cambridge.
11. MacKay, D. J. C. 2002. Information Theory, Inference and Learning Algorithms. Cambridge, UK: Cambridge University Press.
12. Mengshoel, O. J.; Wilkins, D. C.; and Roth, D. 2006. Controlled generation of hard and easy Bayesian networks: Impact on maximal clique tree in tree clustering. Artificial Intelligence 170(16-17): 1137-1174.
13. Mengshoel, O. J. 2007. Designing resource-bounded reasoners using Bayesian networks: System health monitoring and diagnosis. In Proceedings of the 18th International Workshop on Principles of Diagnosis (DX-07).
14. Mitchell, D.; Selman, B.; and Levesque, H. J. 1992. Hard and easy distributions of SAT problems. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), 459-465.
15. Shenoy, P. P. 1989. A valuation-based language for expert systems. International Journal of Approximate Reasoning 5(3):383-411.
16. Shwe, M.; Middleton, B.; Heckerman, D.; Henrion, M.; Horvitz, E.; Lehmann, H.; and Cooper, G. 1991. Probabilistic diagnosis using a reformulation of the INTERNIST1/QMR knowledge base: I. The probabilistic model and inference algorithms. Methods of Information in Medicine 30(4):241-255.
17. Suermondt, H. J., and Cooper, G. F. 1990. Probabilistic inference in multiply connected belief networks using loop cutsets. International Journal of Approximate Reasoning 4:283-306.