Acyclic directed graphs representing independence models
DOI10.1016/J.IJAR.2010.09.005zbMATH Open1209.68354OpenAlexW2014438836MaRDI QIDQ622277FDOQ622277
Authors: Marco Baioletti, Giuseppe Busanello, 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
Recommendations
- Acyclic Directed Graphs to Represent Conditional Independence Models
- Finding P-maps and I-maps to represent conditional independencies
- scientific article; zbMATH DE number 2088047
- An algorithm to find a perfect map for graphoid structures
- DAG representation of asymmetric independence models arising in coherent conditional possibility theory
independence modelsgraphoid propertiesinferential rulesacyclic directed graphsperfect mapprobabilistic independence models
Measures of association (correlation, canonical correlation, etc.) (62H20) Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Logical and algorithmic properties of stable conditional independence
- 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
- Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
- GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS
- Graphoid properties of epistemic irrelevance and independence
- Conditional independence structure and its closure: inferential rules and algorithms
- Bayesian network learning algorithms using structural restrictions
- Racing algorithms for conditional independence inference
- Acyclic Directed Graphs to Represent Conditional Independence Models
- Compositional models and conditional independence in evidence theory
- Independence for full conditional measures and their graphoid properties
Cited In (11)
- Marginals of DAG-Isomorphic Independence Models
- DAG representation of asymmetric independence models arising in coherent conditional possibility theory
- Identification of structures and causation in flow graphs
- THE REPRESENTATION POWER OF PROBABILISTIC KNOWLEDGE BY UNDIRECTED GRAPHS AND DIRECTED ACYCLIC GRAPHS: A COMPARISON
- An algorithm to find a perfect map for graphoid structures
- A heuristic procedure for finding hidden variables
- Finding P-maps and I-maps to represent conditional independencies
- Matrix representations and independencies in directed acyclic graphs
- Representing independence models with elementary triplets
- Title not available (Why is that?)
- Study on the simplified interpretative structural modeling method for the directed acyclic graph
Uses Software
This page was built for publication: Acyclic directed graphs representing independence models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622277)
