Greedy Causal Discovery Is Geometric
From MaRDI portal
Cites work
- 10.1162/153244303321897717
- A characterization of Markov equivalence classes for acyclic digraphs
- Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
- Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
- Computing convex hulls and counting integer points with \texttt{polymake}
- Consistency guarantees for greedy permutation-based causal inference algorithms
- Generalized Permutohedra from Probabilistic Graphical Models
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- scientific article; zbMATH DE number 2150792 (Why is no real title available?)
- Lectures on Polytopes
- polymake: a framework for analyzing convex polytopes
- Statistical Analysis of Financial Data in S-Plus
- The max-min hill-climbing Bayesian network structure learning algorithm
- Towards using the chordal graph polytope in learning decomposable models
Cited in
(4)
This page was built for publication: Greedy Causal Discovery Is Geometric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883283)