Identifying independence in bayesian networks
From MaRDI portal
Publication:5202223
DOI10.1002/net.3230200504zbMath0724.05066OpenAlexW2034009564MaRDI QIDQ5202223
Thomas S. Verma, Judea Pearl, Dan Geiger
Publication date: 1990
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230200504
Related Items
Graphoid properties of epistemic irrelevance and independence, An axiomatic framework for propagating uncertainty in directed acyclic networks, MODELLING DEPENDENCE IN DEMPSTER-SHAFER THEORY, A New Criterion for Confounder Selection, Conservative independence-based causal structure learning in absence of adjacency faithfulness, On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry, Belief function independence: I. The marginal case, Approximate algorithms for credal networks with binary variables, The contagion channels of July--August-2011 stock market crash: a DAG-copula based approach, Logical and algorithmic properties of independence and their application to Bayesian networks, Causality, Conditional Independence, and Graphical Separation in Settable Systems, Reversibility and equivalence in directed Markov fields, Unnamed Item, Performance evaluation of imputation based on Bayesian networks, Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem, The effect of combination functions on the complexity of relational Bayesian networks, Axioms of causal relevance, Computing lower and upper expectations under epistemic independence, Covariate selection for identifying the effects of a particular type of conditional plan using causal networks, Knowledge representation and inference in similarity networks and Bayesian multinets, A new notion of convexity in digraphs with an application to Bayesian networks, Using hidden nodes in Bayesian networks, Belief networks revisited, Defense and security planning under resource uncertainty and multi‐period commitments, Sequences of regressions and their independences, Reasoning about causality in games, Algebraic properties of HTC-identifiable graphs, THE INFORMATION BOTTLENECK METHOD FOR OPTIMAL PREDICTION OF MULTILEVEL AGENT-BASED SYSTEMS, An algorithmic approach to identify irrelevant information in sequential teams, Characterization of causal ancestral graphs for time series with latent confounders, Multi-agent influence diagrams for representing and solving games., Probability distributions with summary graph structure, Unnamed Item, On Directed and Undirected Propagation Algorithms for Bayesian Networks, Covariate selection for identifying the causal effects of stochastic interventions using causal networks, Marginal AMP chain graphs, Markov properties for mixed graphs, Bayesian network classifiers for identifying the slope of the customer lifecycle of long-life customers., Credal networks under epistemic irrelevance: the sets of desirable gambles approach, Quantum graphical models and belief propagation, Fusion and propagation with multiple observations in belief networks, Multivariate statistical matching using graphical modeling, Green and grue causal variables, Copula directed acyclic graphs, Anytime anyspace probabilistic inference, A logical approach to context-specific independence, Join tree propagation with prioritized messages, Directed graphs, information structure and forecast combinations: an empirical examination of US unemployment rates, Improvements to variable elimination and symbolic probabilistic inference for evaluating influence diagrams, Most frugal explanations in Bayesian networks, SEMIPARAMETRIC REGRESSION AND GRAPHICAL MODELS, Unifying Markov properties for graphical models, A Novel Predictive-Coding-Inspired Variational RNN Model for Online Prediction and Recognition, On chain graph models for description of conditional independence structures, Inference in belief networks: A procedural guide, Minimal sufficient causation and directed acyclic graphs, A Logical Approach to Context-Specific Independence, Matrix representations and independencies in directed acyclic graphs, Faithfulness of Probability Distributions and Graphs, Disintegration and Bayesian inversion via string diagrams, Unnamed Item, Separation and completeness properties for AMP chain graph Markov models., Dynamical Variational Autoencoders: A Comprehensive Review, The L-separation criterion for description of cs-independence models, Probabilistic compositional models: solution of an equivalence problem, Independence for full conditional probabilities: structure, factorization, non-uniqueness, and Bayesian networks, Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms, Conditional independence in max-linear Bayesian networks, Unnamed Item
Cites Work
