GADAG: A Genetic Algorithm for Learning Directed Acyclic Graphs

Sparse large Directed Acyclic Graphs learning with a combination of a convex program and a tailored genetic algorithm (see Champion et al. (2017) <https://hal.archives-ouvertes.fr/hal-01172745v2/document>).

Package details

AuthorMagali Champion, Victor Picheny and Matthieu Vignes
MaintainerMagali Champion <[email protected]>
LicenseGPL-2
Version0.99.0
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:
install.packages("GADAG")

Try the GADAG package in your browser

Any scripts or data that you put into this service are public.

GADAG documentation built on May 2, 2019, 3:25 p.m.