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

DOI10.1007/S10472-008-9101-XzbMATH Open1180.68269OpenAlexW2157529132MaRDI QIDQ735239FDOQ735239

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

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

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)

Cites Work

• Causal inference from graphical models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Causal diagrams for empirical research
• IDENTIFIABILITY CRITERIA FOR CAUSAL EFFECTS OF JOINT INTERVENTIONS

Cited In (9)

• 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
• Enhancing identification of causal effects by pruning

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)