Logical and algorithmic properties of conditional independence and graphical models
DOI10.1214/AOS/1176349407zbMATH Open0814.62006OpenAlexW2038254774WikidataQ60306866 ScholiaQ60306866MaRDI QIDQ1317261FDOQ1317261
Authors: Dan Geiger, Judea Pearl 
Publication date: 18 June 1995
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1176349407
Recommendations
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
- scientific article; zbMATH DE number 2150792
- Logical and algorithmic properties of stable conditional independence
- On stochastic conditional independence: The problems of characterization and description
- Conditional independence structure and its closure: inferential rules and algorithms
graphical modelsconditional independenceMarkov networksMarkov fieldsaxiomatic basisunconditional independencegraph separationbinary factorizations of strictly positive probability models
Applications of graph theory (05C90) Random fields (60G60) Foundations and philosophical topics in statistics (62A01) Axioms; other general questions in probability (60A05) Foundations of probability theory (60A99)
Cited In (47)
- Near-exact distributions for the likelihood ratio test statistic for testing multisample independence -- the real and complex cases
- Category-theoretic structure for independence and conditional independence
- Towards classification of semigraphoids.
- Learning causal Bayesian networks using minimum free energy principle
- GRAPHOID PROPERTIES OF QUALITATIVE POSSIBILISTIC INDEPENDENCE RELATIONS
- On the finite and general implication problems of independence atoms and keys
- Title not available (Why is that?)
- Causality, conditional independence, and graphical separation in settable systems
- Title not available (Why is that?)
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
- Exploiting independencies to compute semigraphoid and graphoid structures
- Separoids: a mathematical framework for conditional independence and irrelevance
- Approximation logics for subclasses of probabilistic conditional independence and hierarchical dependence on incomplete data
- Logical and algorithmic properties of stable conditional independence
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- A complete axiomatization of full acyclic join dependencies
- On the toric algebra of graphical models
- Conditional independence structure and its closure: inferential rules and algorithms
- Conditional independence in valuation-based systems
- Conditional independence and natural conditional functions
- Determining full conditional independence by low-order conditioning
- Contribution of František Matúš to the research on conditional independence.
- Characterisation of conditional independence structures for polymatroids using vanishing sets.
- Gaussoids are two-antecedental approximations of Gaussian conditional independence structures
- Graphical models of separation logic
- Multigraded commutative algebra of graph decompositions
- Integrating Bayesian networks and decision trees in a sequential rule-based transportation model
- On chain graph models for description of conditional independence structures
- Context-specific independence in graphical log-linear models
- Logical and algorithmic properties of independence and their application to Bayesian networks
- Decomposition of two classes of structural models
- Self-adhesivity in lattices of abstract conditional independence models
- Mutual conditional independence and its applications to model selection in Markov networks
- Standard imsets for undirected and chain graphical models
- A recovery algorithm for chain graphs
- An axiomatic framework for propagating uncertainty in directed acyclic networks
- Title not available (Why is that?)
- A note on faithfulness and total positivity
- A review of Gaussian Markov models for conditional independence
- Abstract functional dependency structures
- Quasi-separable preferences
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
- Interventionist decision theory
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts1
- Racing algorithms for conditional independence inference
- Concise representations and construction algorithms for semi-graphoid independency models
This page was built for publication: Logical and algorithmic properties of conditional independence and graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317261)
