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

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

AuthorRu Wang, Jie Peng
Date of publication2014-06-25 23:58:06
MaintainerJie Peng <jiepeng@ucdavis.edu>
LicenseGPL (>= 2)
Version1.1
Package repositoryView on CRAN
InstallationInstall the latest version of this package by entering the following in R:
install.packages("dagbag")

Popular 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...
See all...

All man pages Function index File listing

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

Functions

example Man page
move_adj Source code
result_skeleton Source code
score Man page Source code
score_shd Man page Source code
y.stand Source code

Files

src
src/Makevars
src/BIC_comp_dposv.c
NAMESPACE
data
data/example.rda
R
R/score.R
R/score_shd.R
MD5
DESCRIPTION
man
man/score.Rd
man/score_shd.Rd
man/example.Rd
dagbag documentation built on May 19, 2017, 12:01 p.m.

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs in the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.