Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective

DOI10.1016/J.IJAR.2006.09.007zbMATH Open1132.68777OpenAlexW2062290210MaRDI QIDQ2463643FDOQ2463643

Authors: Dan Wu 

Publication date: 14 December 2007

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

Full work available at URL: https://doi.org/10.1016/j.ijar.2006.09.007

Recommendations

• A construction algorithm of MPD-JT for Bayesian networks based on full conditional independence
• scientific article; zbMATH DE number 1983174
• scientific article; zbMATH DE number 1927376
• Graph structures in relational databases, constraint satisfaction and Bayesian networks
• scientific article; zbMATH DE number 6873974

zbMATH Keywords

Bayesian networksconditional independencejunction treesmultivalued dependencemaximal prime subgraph decomposition

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal decomposition by clique separators
• On the Equivalence of Database Models
• Hierarchical schemata for relational databases
• Title not available (Why is that?)

Cited In (5)

• Title not available (Why is that?)
• GLOBAL PROPAGATION IN BAYESIAN NETWORKS VS SEMIJOIN PROGRAMS IN RELATIONAL DATABASES
• A construction algorithm of MPD-JT for Bayesian networks based on full conditional independence
• Junction trees of general graphs
• Upper-lower bounds candidate sets searching algorithm for Bayesian network structure learning

This page was built for publication: Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective

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