A factor tree inference algorithm for Bayesian networks and its applications

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2004, Pages 652-656

  Liao, Wenhui ^a   Zhang, Weihong ^a   Ji, Qiang ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS (BN); CONDITIONAL PROBABILITY TABLE (CPT); DIRECTED ACYCLIC GRAPHS (DAG); QUERY VARIABLES;

ALGORITHMS; GRAPH THEORY; PROBABILITY; QUERY LANGUAGES; SET THEORY; TREES (MATHEMATICS);

COMPUTER NETWORKS;

EID: 16244372379     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2004.9     Document Type: Conference Paper

References (6)

1. S. Arngorg, D. G. Corneil, and A. Proskurowski. Complexity of finding embedding in a k-tree. SIAM Journal of Algorithm and Discrete Mathematics, 8:277-284, 1987.
2. G. Cooper. Probabilistic inference using belief networks is np-hard. Technical Report KSL-87-27. Medical Computer Science Group, Stanford University, 1987.
3. R. Dechter. Bucket elimination: A unifying framework for probabilistic inference. In E. Horvitz and F. Jensen, editors. Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI96), pages 211-219, San Francisco, Aug 1-4 1996. Morgan Kaufmann Publishers.
4. F. V. Jensen and F. Jensen. Optimal junction trees. In Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence, 1994.
5. J. Pearl. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann Publishers, 1988.
6. [6) N. L. Zhang. Computational properties of two exact algorithms for Bayesian networks. Journal of Applied Intelligence, 9:173-184, 1998.