dagbag: Learning directed acyclic graphs (DAGs) through bootstrap aggregating

dagbag is a set of methods that learn DAGs via bootstrap aggregating.

Author
Ru Wang, Jie Peng
Date of publication
2014-06-25 23:58:06
Maintainer
Jie Peng <jiepeng@ucdavis.edu>
License
GPL (>= 2)
Version
1.1

View on CRAN

Man pages

example
An example with n=102 samples and p=102 nodes
score
A function to learn a DAG model by the hill climbing...
score_shd
A function to use structural hamming distance to aggregate...

Files in this package

dagbag
dagbag/src
dagbag/src/Makevars
dagbag/src/BIC_comp_dposv.c
dagbag/NAMESPACE
dagbag/data
dagbag/data/example.rda
dagbag/R
dagbag/R/score.R
dagbag/R/score_shd.R
dagbag/MD5
dagbag/DESCRIPTION
dagbag/man
dagbag/man/score.Rd
dagbag/man/score_shd.Rd
dagbag/man/example.Rd