GADAG aims at learning sparse large Directed Acyclic Graphs with a combination of a convex program and a tailored genetic algorithm.
Package details |
|
|---|---|
| Author | Magali Champion, Victor Picheny and Matthieu Vignes |
| Maintainer | Magali Champion <magali.champion@parisdescartes.fr> |
| License | GPL-2 |
| Version | 0.99.1 |
| Package repository | View on GitHub |
| Installation |
Install the latest version of this package by entering the following in R:
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.