scientific article; zbMATH DE number 7306854
From MaRDI portal
Publication:5148926
No author found.
Publication date: 5 February 2021
Full work available at URL: https://jmlr.csail.mit.edu/papers/v21/18-083.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Uses Software
Cites Work
- The max-min hill-climbing Bayesian network structure learning algorithm
- Estimating high-dimensional intervention effects from observational data
- Causation, prediction, and search
- A characterization of Markov equivalence classes for acyclic digraphs
- Confounding and collapsibility in causal inference
- Discovering and orienting the edges connected to a target variable in a DAG via a sequential local learning approach
- On scoring maximal ancestral graphs with the max-min hill climbing algorithm
- Ancestral graph Markov models.
- Learning Bayesian networks: The combination of knowledge and statistical data
- Estimating the effect of joint interventions from observational data in sparse high-dimensional settings
- Estimating bounds on causal effects in high-dimensional and possibly confounded systems
- Algorithms for the Assignment and Transportation Problems
- Bounds on Direct Effects in the Presence of Confounded Intermediate Variables
- Statistics and Causal Inference
- 10.1162/153244302760200696
- 10.1162/153244303321897717
- Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
