On the completeness of an identifiability algorithm for semi-Markovian models

DOI10.1007/S10472-008-9101-XMaRDI QIDQ735239zbMATH OpenOpenAlexFDO

Authors Marco Valtorta, Yi-min Huang

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

zbMATH Keywords

directed acyclic graphcausal Bayesian network

Mathematics Subject Classification ID

Bayesian inference (62F15) Graphical methods in statistics (62A09) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Estimation for semi-Markov models with partial observations via self-consistency equations
• An algorithmic approach to non-homogeneous semi-markov processes
• On the identification of continuous-time Markov chains with a given invariant measure
• scientific article; zbMATH DE number 1447424
• scientific article; zbMATH DE number 4066093
• Analysis of an identification algorithm arising in the adaptive estimation of Markov chains
• Irreducible continuous model identification via Markov parameter estimation
• Optimality of estimators for misspecified semi-Markov models

Cites work

• scientific article; zbMATH DE number 1136443 (Why is no real title available?)
• scientific article; zbMATH DE number 1493045 (Why is no real title available?)
• Causal diagrams for empirical research
• Causal inference from graphical models
• IDENTIFIABILITY CRITERIA FOR CAUSAL EFFECTS OF JOINT INTERVENTIONS

Cited in

(9)

• Enhancing identification of causal effects by pruning
• Causal inference via string diagram surgery. A diagrammatic approach to interventions and counterfactuals
• Generic identifiability of linear structural equation models by ancestor decomposition
• On identifying causal effects
• IDENTIFIABILITY IN CAUSAL BAYESIAN NETWORKS: A GENTLE INTRODUCTION
• VE dimension induced by Bayesian networks over the Boolean domain
• The explanation game: a formal framework for interpretable machine learning
• On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
• Simplifying probabilistic expressions in causal inference

This page was built for publication: On the completeness of an identifiability algorithm for semi-Markovian models

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