On the completeness of an identifiability algorithm for semi-Markovian models
From MaRDI portal
Publication:735239
DOI10.1007/s10472-008-9101-xzbMath1180.68269OpenAlexW2157529132MaRDI QIDQ735239
Publication date: 21 October 2009
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-008-9101-x
Bayesian inference (62F15) Reasoning under uncertainty in the context of artificial intelligence (68T37) Graphical methods in statistics (62A09)
Related Items (4)
Causal inference via string diagram surgery ⋮ The explanation game: a formal framework for interpretable machine learning ⋮ VE dimension induced by Bayesian networks over the Boolean domain ⋮ Generic Identifiability of Linear Structural Equation Models by Ancestor Decomposition
Cites Work
This page was built for publication: On the completeness of an identifiability algorithm for semi-Markovian models