Acyclic directed graphs representing independence models
From MaRDI portal
(Redirected from Publication:622277)
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
Cites work
- 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 176109 (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 1493045 (Why is no real title available?)
- scientific article; zbMATH DE number 2150792 (Why is no real title available?)
- Acyclic Directed Graphs to Represent Conditional Independence Models
- Bayesian network learning algorithms using structural restrictions
- CONDITIONAL INDEPENDENCE RELATIONS IN POSSIBILITY THEORY
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
- Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
- Compositional models and conditional independence in evidence theory
- Conditional independence in a coherent finite setting
- Conditional independence in valuation-based systems
- Conditional independence structure and its closure: inferential rules and algorithms
- GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS
- Graphoid properties of epistemic irrelevance and independence
- Independence concepts in possibility theory. I
- Independence for full conditional measures and their graphoid properties
- Learning Bayesian network parameters under order constraints
- Logical and algorithmic properties of stable conditional independence
- 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
- Racing algorithms for conditional independence inference
- 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
Cited in
(11)- DAG representation of asymmetric independence models arising in coherent conditional possibility theory
- Marginals of DAG-Isomorphic Independence Models
- 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
- scientific article; zbMATH DE number 2088047 (Why is no real title available?)
- Study on the simplified interpretative structural modeling method for the directed acyclic graph
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)
