GADAG: A genetic algorithm for learning directed acyclic graphs

Simple item page
dc.contributor.authorChampion M
dc.contributor.authorPicheny V
dc.contributor.authorVignes M
dc.date.accessioned2024-07-24T22:45:19Z
dc.date.available2024-07-24T22:45:19Z
dc.date.issued2017-04-11
dc.description.abstractSparse large Directed Acyclic Graphs learning with a combination of a convex program and a tailored genetic algorithm.
dc.identifierhttps://cran.r-project.org/package=GADAG
dc.identifier.citation2017
dc.identifier.elements-id342552
dc.identifier.urihttps://mro.massey.ac.nz/handle/10179/70333
dc.relation.urihttps://cran.r-project.org/web/packages/GADAG/index.html
dc.titleGADAG: A genetic algorithm for learning directed acyclic graphs
dc.typeJournal article
pubs.confidentialfalse
pubs.declined2017-04-13T17:37:42.206+1200
pubs.notesNot known
pubs.organisational-group/Massey University
pubs.organisational-group/Massey University/College of Sciences
pubs.organisational-group/Massey University/College of Sciences/Institute of Fundamental Sciences
Files
Collections
Internet Publication