CCDr Algorithm for Learning Sparse Gaussian Bayesian Networks
Overview
Implementation of the CCDr (Concave penalized Coordinate Descent with reparametrization) structure learning algorithm as described in Aragam and Zhou (2015) https://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.
Notes
- Minor patch to fix failing CRAN check
From NEWS.md in the release
Install
Health
CRAN check results are not tracked yet.
Documentation
- Help pages
- 3includes a package overview page
- Examples that run
- 100%2 run in a plain check
- Exported functions with examples
- 100%
- Documented parameters
- 100%
- Return-value docs
- 50%
- Help pages citing references
- 0%
Downloads
Dependencies
Code & Tests
People & History
Pick two releases to compare their code metrics.
- RR 4.3.0 released · 2023-04-21
- archivedRemoved from CRAN2022-08-14repeated policy violation Spamming CRAN team members' personal email addresses, repeatedly
- RR 4.2.0 released · 2022-04-22
- 0.0.62022-04-12 · diff ↗
- RR 4.1.0 released · 2021-05-18
- RR 4.0.0 released · 2020-04-24
- RR 3.6.0 released · 2019-04-26
- 0.0.52018-06-01 · diff ↗
- RR 3.5.0 released · 2018-04-23
- 0.0.42017-09-11 · diff ↗
- RR 3.4.0 released · 2017-04-21
- 0.0.3
- 0.0.22016-11-20 · diff ↗
- 0.0.12016-08-10
- RR 3.3.0 released · 2016-05-03
Package metadata
- First published
- 2016-08-10
- Total releases
- 6 / 10 yrs
- License
- GPL (>= 2) OSI
- Minimum R
- ≥ 3.2.3
Cite
Cite this package
Run in R for the authors' entry:
citation("ccdrAlgorithm")The package provides a citation file, so citation() returns the authors' own entry.
Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-10-25, which the citation names so these numbers can be found later. More on citing and the projects behind them.