Construction of minimal d-separators in a dependency system

DOI10.1007/S10559-009-9136-YzbMATH Open1216.05045OpenAlexW1996786815MaRDI QIDQ844349FDOQ844349

Authors: A. S. Balabanov 

Publication date: 19 January 2010

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

Full work available at URL: https://doi.org/10.1007/s10559-009-9136-y

Recommendations

• Minimal separators in dependency structures: properties and identification
• Computation in causal graphs
• Logic of minimal separation in causal networks
• scientific article; zbMATH DE number 4189228
• Inference of structures of models of probabilistic dependences from statistical data

zbMATH Keywords

Bayesian networkconditional independenceacyclic digraphcolliderchain\(d\)-separation criterioncausal faithfulnessDAG modelfinding a locally minimal separatoridentification of edges of a modellocally minimal separatorprobabilistic dependenceprobabilistic dependency model

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Knowledge representation (68T30)

Cites Work

• Causal inference from graphical models
• Title not available (Why is that?)
• Minimal separators in dependency structures: properties and identification

Cited In (6)

• Logic of causal inference from data under presence of latent confounders
• Logic of minimal separation in causal networks
• Minimal separators in dependency structures: properties and identification
• Computation in causal graphs
• Title not available (Why is that?)
• A note on minimal d-separation trees for structural learning

This page was built for publication: Construction of minimal \(d\)-separators in a dependency system

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