Conditional independence structure and its closure: inferential rules and algorithms
From MaRDI portal
Publication:962920
Recommendations
- scientific article; zbMATH DE number 2150792
- Logical and algorithmic properties of conditional independence and graphical models
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
- Efficient algorithms for conditional independence inference
- A linear-algebraic tool for conditional independence inference
- Logical and algorithmic properties of stable conditional independence
- On Gaussian conditional independence structures
- A universal algebraic approach for conditional independence
- A computational algebraic-geometry method for conditional-independence inference
Cites work
- Bayesian network learning algorithms using structural restrictions
- Conditional independence in a coherent finite setting
- Conditional independence in valuation-based systems
- CONDITIONAL INDEPENDENCE RELATIONS IN POSSIBILITY THEORY
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
- Graphoid properties of epistemic irrelevance and independence
- GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS
- scientific article; zbMATH DE number 992990 (Why is no real title available?)
- scientific article; zbMATH DE number 4211299 (Why is no real title available?)
- scientific article; zbMATH DE number 3635280 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 3055208 (Why is no real title available?)
- Ignorable common information, null sets and Basu's first theorem
- Independence concepts in possibility theory. I
- Learning Bayesian network parameters under order constraints
- On chain graph models for description of conditional independence structures
- Operations for inference in continuous Bayesian networks with linear deterministic variables
- Possibility theory: conditional independence
- Probabilistic Networks and Expert Systems
- Qualitative Bayesian networks with logical constraints
- Semigraphoids and structures of probabilistic conditional independence
- Separoids: a mathematical framework for conditional independence and irrelevance
- Stochastic independence in a coherent setting
- Strong conditional independence for credal sets
- The L-separation criterion for description of cs-independence models
- The role of coherence for handling probabilistic evaluations and independence
- The role of coherence in eliciting and handling imprecise probabilities and its application to medical diagnosis
Cited in
(23)- Logical and algorithmic properties of conditional independence and graphical models
- Semigraphoids and structures of probabilistic conditional independence
- Conditional independence structures examined via minors
- Generalized rules of probabilistic independence
- A lattice-based representation of independence relations for efficient closure computation
- Independence for full conditional probabilities: structure, factorization, non-uniqueness, and Bayesian networks
- Asymmetric decomposability and persegram representation in coherent conditional probability theory
- Concise representations and construction algorithms for semi-graphoid independency models
- Representing independence models with elementary triplets
- A universal algebraic approach for conditional independence
- DAG representation of asymmetric independence models arising in coherent conditional possibility theory
- Finding P-maps and I-maps to represent conditional independencies
- An algorithm to find a perfect map for graphoid structures
- Computing concise representations of semi-graphoid independency models
- Acyclic Directed Graphs to Represent Conditional Independence Models
- A computational algebraic-geometry method for conditional-independence inference
- Qualitative combination of independence models
- Exploiting independencies to compute semigraphoid and graphoid structures
- Compositional models and conditional independence in evidence theory
- Consequences of the minimum specificity principle on conditioning and on independence in possibility theory
- Acyclic directed graphs representing independence models
- Self-adhesivity in lattices of abstract conditional independence models
- Logical and algorithmic properties of stable conditional independence
This page was built for publication: Conditional independence structure and its closure: inferential rules and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962920)
