An alternative characterization of a Bayesian network.

DOI10.1016/S0888-613X(03)00020-3MaRDI QIDQ1427933zbMATH OpenFDO

Authors S. K. M. Wong, Tao Lin

Publication date 14 March 2004

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

Bayesian networksAcyclic hypergraphsDirected acyclic graphsHierarchical conditional independencies

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• scientific article; zbMATH DE number 2088047
• Identifying independence in bayesian networks
• Construction of Bayesian network structures from data: A brief survey and an efficient algorithm
• Characteristic imsets for learning Bayesian network structure
• scientific article; zbMATH DE number 1149408

Cites work

• scientific article; zbMATH DE number 4178809 (Why is no real title available?)
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• scientific article; zbMATH DE number 2088048 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• A probabilistic framework for cooperative multi-agent distributed interpretation and optimization of communication
• Learning Bayesian networks: The combination of knowledge and statistical data
• On the Desirability of Acyclic Database Schemes
• On the Equivalence of Database Models

Cited in

(2)

• Information graphs and their use for Bayesian network graph construction
• The marginal factorization of Bayesian networks and its application

This page was built for publication: An alternative characterization of a Bayesian network.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1427933)