Coordinate-Descent Algorithm for Learning Sparse Discrete Bayesian Networks

Structure learning of Bayesian network using coordinate-descent algorithm. This algorithm is designed for discrete network assuming a multinomial data set, and we use a multi-logit model to do the regression. The algorithm is described in Gu, Fu and Zhou (2016) .


An algorithm to learn structure of discrete Bayesian network, this package can deal with observational data, interventional data, or a misture of both.

  • 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.

News

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("discretecdAlgorithm")

0.0.5 by Jiaying Gu, 2 months ago


Browse source code at https://github.com/cran/discretecdAlgorithm


Authors: Jiaying Gu [aut, cre]


Documentation:   PDF Manual  


GPL (>= 2) license


Imports Rcpp, sparsebnUtils, igraph

Suggests testthat

Linking to Rcpp, RcppEigen

System requirements: C++11


Depended on by sparsebn.


See at CRAN