Bayesian network structure learning based on topological order and penalty likelihood
From MaRDI portal
Cites work
- 10.1162/153244304773936045
- Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
- Constrained likelihood for reconstructing a directed acyclic Gaussian graph
- Detecting causality in complex ecosystems
- scientific article; zbMATH DE number 5654346 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- Large-sample learning of Bayesian networks is NP-hard
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- The Adaptive Lasso and Its Oracle Properties
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Bayesian network structure learning based on topological order and penalty likelihood
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6919838)