Minimal separators in dependency structures: properties and identification

DOI10.1007/s10559-008-9055-3zbMath1179.68104OpenAlexW1967682501MaRDI QIDQ1008353

A. S. Balabanov

Publication date: 27 March 2009

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-008-9055-3

zbMATH Keywords

chainconditional independenceBayesian networkacyclic digraphcollideridentification of edges\(d\)-separation criterionDAG modelprobabilistic dependency modelconstraint-based learning algorithmlocally minimal separatorsnecessary requirements on members of locally minimal separatorsselection of separators

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (3)

Construction of minimal \(d\)-separators in a dependency system ⋮ Logic of minimal separation in causal networks ⋮ Logic of causal inference from data under presence of latent confounders

Cites Work

• Inference of structures of models of probabilistic dependences from statistical data
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal separators in dependency structures: properties and identification