Acyclic directed graphs representing independence models
From MaRDI portal
Publication:622277
DOI10.1016/j.ijar.2010.09.005zbMath1209.68354MaRDI QIDQ622277
Giuseppe Busanello, Marco Baioletti, Barbara Vantaggi
Publication date: 31 January 2011
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2010.09.005
perfect map; independence models; graphoid properties; inferential rules; acyclic directed graphs; probabilistic independence models
62H20: Measures of association (correlation, canonical correlation, etc.)
68R10: Graph theory (including graph drawing) in computer science
68T37: Reasoning under uncertainty in the context of artificial intelligence
Related Items
DAG representation of asymmetric independence models arising in coherent conditional possibility theory, Identification of structures and causation in flow graphs, Representing independence models with elementary triplets, Finding P–Maps and I–Maps to Represent Conditional Independencies
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compositional models and conditional independence in evidence theory
- Graphoid properties of epistemic irrelevance and independence
- Conditional independence structure and its closure: inferential rules and algorithms
- Logical and algorithmic properties of stable conditional independence
- Bayesian network learning algorithms using structural restrictions
- Racing algorithms for conditional independence inference
- Independence concepts in possibility theory. I
- Conditional independence in valuation-based systems
- Semigraphoids and structures of probabilistic conditional independence
- Stochastic independence in a coherent setting
- 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
- Possibility theory: conditional independence
- Operations for inference in continuous Bayesian networks with linear deterministic variables
- Learning Bayesian network parameters under order constraints
- CONDITIONAL INDEPENDENCE RELATIONS IN POSSIBILITY THEORY
- Acyclic Directed Graphs to Represent Conditional Independence Models
- Probabilistic Networks and Expert Systems
- GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
