Approximate implication for probabilistic graphical models
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 176109 (Why is no real title available?)
- scientific article; zbMATH DE number 3635280 (Why is no real title available?)
- scientific article; zbMATH DE number 7471694 (Why is no real title available?)
- scientific article; zbMATH DE number 4189228 (Why is no real title available?)
- scientific article; zbMATH DE number 7650996 (Why is no real title available?)
- A new outlook on Shannon's information measures
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- Axioms and algorithms for inferences involving probabilistic independence
- Conditional independence and basic Markov properties
- Decompositions and functional dependencies in relations
- Identifying independence in bayesian networks
- Independence in database relations
- Information theory and network coding
- Learning Bayesian networks from data: An information-theory based approach
- Logical and algorithmic properties of conditional independence and graphical models
- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
- On the menbership problem for functional and multivalued dependencies in relational databases
- On the undecidability of implications between embedded multivalued database dependencies
- Probabilistic graphical models.
- Undecidability of Network Coding, Conditional Information Inequalities, and Conditional Independence Implication
This page was built for publication: Approximate implication for probabilistic graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7014325)
