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).
- Version0.99.0
- R versionunknown
- LicenseGPL-2
- Needs compilation?Yes
- Last release04/11/2017
Team
Magali Champion
Victor Picheny
Matthieu Vignes
Insights
Last 30 days
This package has been downloaded 438 times in the last 30 days. Now we're getting somewhere! Enough downloads to populate a lively group chat. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 4 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 5,569 times in the last 365 days. Impressive! The kind of number that makes colleagues ask, 'How did you do it?' The day with the most downloads was Apr 12, 2025 with 60 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Depends2 packages
- Imports1 package
- Linking To2 packages