Conditional independence structure and its closure: inferential rules and algorithms
From MaRDI portal
Publication:962920
DOI10.1016/J.IJAR.2009.05.002zbMATH Open1185.62009OpenAlexW2102123707MaRDI QIDQ962920FDOQ962920
Authors: Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi 
Publication date: 7 April 2010
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2009.05.002
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
Foundations and philosophical topics in statistics (62A01) Measures of association (correlation, canonical correlation, etc.) (62H20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic Networks and Expert Systems
- Stochastic independence in a coherent setting
- Possibility theory: conditional independence
- Conditional independence in valuation-based systems
- Title not available (Why is that?)
- CONDITIONAL INDEPENDENCE RELATIONS IN POSSIBILITY THEORY
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
- Independence concepts in possibility theory. I
- Semigraphoids and structures of probabilistic conditional independence
- Strong conditional independence for credal sets
- The L-separation criterion for description of cs-independence models
- On chain graph models for description of conditional independence structures
- Conditional independence in a coherent finite setting
- Operations for inference in continuous Bayesian networks with linear deterministic variables
- Learning Bayesian network parameters under order constraints
- The role of coherence for handling probabilistic evaluations and independence
- GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS
- Qualitative Bayesian networks with logical constraints
- The role of coherence in eliciting and handling imprecise probabilities and its application to medical diagnosis
- Graphoid properties of epistemic irrelevance and independence
- Bayesian network learning algorithms using structural restrictions
- Ignorable common information, null sets and Basu's first theorem
- Separoids: a mathematical framework for conditional independence and irrelevance
- Title not available (Why is that?)
Cited In (21)
- DAG representation of asymmetric independence models arising in coherent conditional possibility theory
- Consequences of the minimum specificity principle on conditioning and on independence in possibility theory
- Compositional models and conditional independence in evidence theory
- Exploiting independencies to compute semigraphoid and graphoid structures
- Acyclic directed graphs representing independence models
- Qualitative combination of independence models
- Logical and algorithmic properties of conditional independence and graphical models
- Logical and algorithmic properties of stable conditional independence
- Independence for full conditional probabilities: structure, factorization, non-uniqueness, and Bayesian networks
- An algorithm to find a perfect map for graphoid structures
- Conditional independence structures examined via minors
- A universal algebraic approach for conditional independence
- Asymmetric decomposability and persegram representation in coherent conditional probability theory
- Finding P-maps and I-maps to represent conditional independencies
- Computing concise representations of semi-graphoid independency models
- Self-adhesivity in lattices of abstract conditional independence models
- Acyclic Directed Graphs to Represent Conditional Independence Models
- Representing independence models with elementary triplets
- A computational algebraic-geometry method for conditional-independence inference
- A lattice-based representation of independence relations for efficient closure computation
- Concise representations and construction algorithms for semi-graphoid independency models
Uses Software
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)
