A formal approach to using data distributions for building causal polytree structures
From MaRDI portal
Publication:2486020
Recommendations
- scientific article; zbMATH DE number 1696753
- Structuring causal trees
- scientific article; zbMATH DE number 733407
- The Geometry of Causal Probability Trees that are Algebraically Constrained
- A note on causal trees and their applications to CCS
- Causal structure learning: a combinatorial perspective
- scientific article; zbMATH DE number 4213438
- A prallel algorithm for building possibilistic causal networks
Cites work
- A Bayesian method for the induction of probabilistic networks from data
- Approximating discrete probability distributions with dependence trees
- scientific article; zbMATH DE number 1696753 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- On Information and Sufficiency
Cited in
(7)- High-dimensional consistency in score-based and hybrid structure learning
- scientific article; zbMATH DE number 1696753 (Why is no real title available?)
- The Geometry of Causal Probability Trees that are Algebraically Constrained
- scientific article; zbMATH DE number 67622 (Why is no real title available?)
- A note on causal trees and their applications to CCS
- The Gaussian polytree EDA with copula functions and mutations
- Learning minimal latent directed information polytrees
This page was built for publication: A formal approach to using data distributions for building causal polytree structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486020)