A construction algorithm of MPD-JT for Bayesian networks based on full conditional independence

DOI10.3969/J.ISSN.1001-506X.2010.06.044MaRDI QIDQ3016695zbMATH OpenFDO

Authors Mingmin Zhu, Youlong Yang, Wei Liu

Publication date 19 July 2011

Full work available at URL https://doi.org/10.3969/J.ISSN.1001-506X.2010.06.044

zbMATH Keywords

Bayesian networkjunction treefull conditional independencemaximal prime sub-graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective
• scientific article; zbMATH DE number 6873974
• A decomposition algorithm for learning Bayesian networks based on scoring function
• scientific article; zbMATH DE number 1983174
• Triangulation of Bayesian networks by retriangulation

Cited in

(2)

• Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective
• scientific article; zbMATH DE number 1983174 (Why is no real title available?)

This page was built for publication: A construction algorithm of MPD-JT for Bayesian networks based on full conditional independence

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