README.md
In gujyjean/discretecdAlgorithm: Coordinate-Descent Algorithm for Learning Sparse Discrete Bayesian Networks
discretecdAlgorithm
An algorithm to learn structure of discrete Bayesian network, this package can deal with observational data, interventional data, or a mixture of both.
algorithm
cd.run is the main function to run coordinate descent algorithm. With the adaptive option, users may choose to use regular group lasso penalty, or adaptive group lasso penalty.max_lambda is a function to calculate the maximum value of lambda that will penalized all edges to zero.
gujyjean/discretecdAlgorithm documentation built on March 15, 2020, 7:32 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
discretecdAlgorithm
An algorithm to learn structure of discrete Bayesian network, this package can deal with observational data, interventional data, or a mixture of both.
algorithm
cd.runis the main function to run coordinate descent algorithm. With theadaptiveoption, users may choose to use regular group lasso penalty, or adaptive group lasso penalty.max_lambdais a function to calculate the maximum value of lambda that will penalized all edges to zero.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.