The L-separation criterion for description of cs-independence models

DOI10.1016/S0888-613X(01)00069-XzbMATH Open1014.62002MaRDI QIDQ1603305FDOQ1603305

Authors: Barbara Vantaggi 

Publication date: 11 July 2002

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Recommendations

• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• On association models defined over independence graphs
• Separation and completeness properties for AMP chain graph Markov models.
• On chain graph models for description of conditional independence structures
• scientific article; zbMATH DE number 4189228

zbMATH Keywords

directed acyclic graphsconditional probabilities

Mathematics Subject Classification ID

Applications of graph theory (05C90) Foundations and philosophical topics in statistics (62A01) Axioms; other general questions in probability (60A05)

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?)
• Identifying independence in bayesian networks
• Finitely additive conditional probabilities, conglomerability and disintegrations
• Independence and possibilistic conditioning
• Stochastic independence in a coherent setting
• Title not available (Why is that?)
• Coherent numerical and ordinal probabilistic assessments
• Representation of conditional probability measures on Boolean algebras
• CONDITIONAL INDEPENDENCE RELATIONS IN POSSIBILITY THEORY
• Semigraphoids and structures of probabilistic conditional independence
• On chain graph models for description of conditional independence structures
• Conditional independence in a coherent finite setting
• Title not available (Why is that?)
• Title not available (Why is that?)
• Null events and stochastical independence.

Cited In (14)

• Computing lower and upper expectations under epistemic independence
• DAG representation of asymmetric independence models arising in coherent conditional possibility theory
• Consequences of the minimum specificity principle on conditioning and on independence in possibility theory
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• Exploiting independencies to compute semigraphoid and graphoid structures
• Acyclic directed graphs representing independence models
• Independence for full conditional probabilities: structure, factorization, non-uniqueness, and Bayesian networks
• Conditional independence structure and its closure: inferential rules and algorithms
• Asymmetric decomposability and persegram representation in coherent conditional probability theory
• Possibility theory: conditional independence
• Credal networks under epistemic irrelevance: the sets of desirable gambles approach
• The role of coherence for handling probabilistic evaluations and independence
• Conditioning in a coherent setting: Theory and applications
• Credal networks under epistemic irrelevance

This page was built for publication: The L-separation criterion for description of cs-independence models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603305)