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.
|Author||Bryon Aragam [aut, cre], Dacheng Zhang [aut]|
|Date of publication||2017-03-10 01:06:02|
|Maintainer||Bryon Aragam <firstname.lastname@example.org>|
|License||GPL (>= 2)|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.