Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective
From MaRDI portal
Publication:2463643
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
Cites work
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 1927376 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- Hierarchical schemata for relational databases
- On the Equivalence of Database Models
- Optimal decomposition by clique separators
Cited in
(6)- Junction trees of general graphs
- A construction algorithm of MPD-JT for Bayesian networks based on full conditional independence
- scientific article; zbMATH DE number 1983174 (Why is no real title available?)
- Upper-lower bounds candidate sets searching algorithm for Bayesian network structure learning
- Graph structures in relational databases, constraint satisfaction and Bayesian networks
- GLOBAL PROPAGATION IN BAYESIAN NETWORKS VS SEMIJOIN PROGRAMS IN RELATIONAL DATABASES
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)