Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach
DOI10.1016/J.IJAR.2019.10.009zbMATH Open1468.68166OpenAlexW2983539546WikidataQ126833755 ScholiaQ126833755MaRDI QIDQ2302940FDOQ2302940
Authors: Kari Rantanen, Antti Hyttinen, Matti Järvisalo 
Publication date: 26 February 2020
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10138/336471
Recommendations
- On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
- scientific article; zbMATH DE number 6276218
- Constraint-based inference algorithms for structural models with latent confounders -- empirical application and simulation
- Learning causal graphs with latent confounders in weak faithfulness violations
- scientific article; zbMATH DE number 6542823
Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Cites Work
- Causation, prediction, and search
- Parameter priors for directed acyclic graphical models and the characterization of several probability distributions
- Title not available (Why is that?)
- A Bayesian method for the induction of probabilistic networks from data
- Learning Bayesian networks: The combination of knowledge and statistical data
- Title not available (Why is that?)
- Computing maximum likelihood estimates in recursive linear models with correlated errors
- Learning optimal Bayesian networks: a shortest path perspective
- Integer linear programming for the Bayesian network structure learning problem
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exploiting the power of MIP solvers in MAXSAT
- Title not available (Why is that?)
- A constraint optimization approach to causal discovery from subsampled time series data
- LMHS: a SAT-IP hybrid MaxSat solver
- On scoring maximal ancestral graphs with the max-min hill climbing algorithm
- The implicit hitting set approach to solve combinatorial optimization problems with an application to multigenome alignment
Cited In (6)
- A survey on causal discovery: theory and practice
- Learning directed acyclic graphs by determination of candidate causes for discrete variables
- Ensemble framework for causality learning with heterogeneous directed acyclic graphs through the lens of optimization
- Causal structure learning: a combinatorial perspective
- On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
- Title not available (Why is that?)
Uses Software
This page was built for publication: Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302940)
