Implementation of the CCDr (Concave penalized Coordinate Descent with reparametrization) structure learning algorithm as described in Aragam and Zhou (2015) <http://www.jmlr.org/papers/v16/aragam15a.html>. This is a fast, score-based method for learning Bayesian networks that uses sparse regularization and block-cyclic coordinate descent.
copied from cf-post-staging / r-ccdralgorithm| Label | Latest Version |
|---|---|
| main | 0.0.6 |
| cf201901 | 0.0.5 |
| cf202003 | 0.0.5 |
| gcc7 | 0.0.5 |
