Independence properties of directed markov fields
From MaRDI portal
Publication:4712941
DOI10.1002/net.3230200503zbMath0743.05065DBLPjournals/networks/LauritzenDLL90OpenAlexW2013567125WikidataQ57394059 ScholiaQ57394059MaRDI QIDQ4712941
Hanns-Georg Leimer, B. N. Larsen, A. Philip Dawid, Steffen L. Lauritzen
Publication date: 25 June 1992
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230200503
Related Items (76)
Causal discovery in heavy-tailed models ⋮ Graphical models for complex networks: an application to Italian museums ⋮ Learning structures from data and experts ⋮ MODELLING DEPENDENCE IN DEMPSTER-SHAFER THEORY ⋮ A New Criterion for Confounder Selection ⋮ A computational theory of decision networks ⋮ Belief function independence: I. The marginal case ⋮ A universal algebraic approach for conditional independence ⋮ A characterization of Markov equivalence classes for acyclic digraphs ⋮ Foundations of compositional models: structural properties ⋮ Causality, Conditional Independence, and Graphical Separation in Settable Systems ⋮ On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs ⋮ Constraint-based inference algorithms for structural models with latent confounders -- empirical application and simulation ⋮ Handling multiple sources of variation using influence diagrams ⋮ A new notion of convexity in digraphs with an application to Bayesian networks ⋮ Irrelevance and parameter learning in Bayesian networks ⋮ An empirical study of testing independencies in Bayesian networks using rp-separation ⋮ A characterization of moral transitive acyclic directed graph Markov models as labeled trees. ⋮ A Bayesian network to analyse basketball players' performances: a multivariate copula-based approach ⋮ DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 3rd part: examples of use and appendices1 ⋮ Latent free equivalent mDAGs ⋮ Graphical models for inference under outcome-dependent sampling ⋮ Stable mixed graphs ⋮ Identifying the consequences of dynamic treatment strategies: a decision-theoretic overview ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ Max-linear models on directed acyclic graphs ⋮ Unnamed Item ⋮ Computation in Causal Graphs ⋮ Bayesian networks for sex-related homicides: structure learning and prediction ⋮ Parameterization and estimation of path models for categorical data ⋮ Modelling mechanisms with causal cycles ⋮ Fusion and propagation with multiple observations in belief networks ⋮ Recursive max-linear models with propagating noise ⋮ A comparison of hybrid strategies for Gibbs sampling in mixed graphical models ⋮ Stable limit theorems for empirical processes under conditional neighborhood dependence ⋮ BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques ⋮ The EM algorithm for graphical association models with missing data ⋮ Causality as a theoretical concept: explanatory warrant and empirical content of the theory of causal nets ⋮ Complete Graphical Characterization and Construction of Adjustment Sets in Markov Equivalence Classes of Ancestral Graphs ⋮ A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data ⋮ A Bayesian network approach to making inferences in causal maps ⋮ On a hypergraph probabilistic graphical model ⋮ Independency relationships and learning algorithms for singly connected networks ⋮ Time-varying Markov regression random-effect model with Bayesian estimation procedures: Application to dynamics of functional recovery in patients with stroke ⋮ Decomposition of two classes of structural models ⋮ Standard imsets for undirected and chain graphical models ⋮ A simple graphical approach for understanding probabilistic inference in Bayesian networks ⋮ On chain graph models for description of conditional independence structures ⋮ A Simple Method for Testing Independencies in Bayesian Networks ⋮ A review of Gaussian Markov models for conditional independence ⋮ Inference in belief networks: A procedural guide ⋮ A characterization of Markov equivalence for directed cyclic graphs ⋮ A recovery algorithm for chain graphs ⋮ Foundations of structural causal models with cycles and latent variables ⋮ Theory-independent limits on correlations from generalized Bayesian networks ⋮ Minimal sufficient causation and directed acyclic graphs ⋮ Decomposition of influence diagrams ⋮ Normal linear regression models with recursive graphical Markov structure ⋮ Matrix representations and independencies in directed acyclic graphs ⋮ Graphs for Margins of Bayesian Networks ⋮ On an Additive Semigraphoid Model for Statistical Networks With Application to Pathway Analysis ⋮ Image analysis with partially ordered Markov models. ⋮ Fast Bayes and the dynamic junction forest ⋮ Hyper-EM for large recursive models of categorical variables. ⋮ Decomposable Probabilistic Influence Diagrams ⋮ The role of conditional likelihoods in latent variable modeling ⋮ Study Design in Causal Models ⋮ Probabilistic Independence Networks for Hidden Markov Probability Models ⋮ Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs ⋮ Separation and completeness properties for AMP chain graph Markov models. ⋮ SIMPLIFYING EXPLANATIONS IN BAYESIAN BELIEF NETWORKS ⋮ Independence concepts in possibility theory. I ⋮ Independence concepts in possibility theory: II ⋮ The size distribution for Markov equivalence classes of acyclic digraph models. ⋮ Decomposition of search for \(v\)-structures in DAGs ⋮ Conditional independence in max-linear Bayesian networks
This page was built for publication: Independence properties of directed markov fields
