CRAN

discretecdAlgorithm 0.0.5

Coordinate-Descent Algorithm for Learning Sparse Discrete Bayesian Networks

Released Sep 10, 2017 by Jiaying Gu

This package can be loaded by Renjin but 5 out 16 tests failed.

Dependencies

Rcpp RcppEigen 0.3.3.4.0 igraph 1.2.1 sparsebnUtils 0.0.6

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

Installation

Maven

This package can be included as a dependency from a Java or Scala project by including the following your project's pom.xml file. Read more about embedding Renjin in JVM-based projects.

<dependencies>
  <dependency>
    <groupId>org.renjin.cran</groupId>
    <artifactId>discretecdAlgorithm</artifactId>
    <version>0.0.5-b17</version>
  </dependency>
</dependencies>
<repositories>
  <repository>
    <id>bedatadriven</id>
    <name>bedatadriven public repo</name>
    <url>https://nexus.bedatadriven.com/content/groups/public/</url>
  </repository>
</repositories>

View build log

Renjin CLI

If you're using Renjin from the command line, you load this library by invoking:

library('org.renjin.cran:discretecdAlgorithm')

Test Results

This package was last tested against Renjin 0.9.2644 on Jun 2, 2018.

Source

R
C
C++

View GitHub Mirror

Release History