Closed rbartelme closed 4 years ago
[x] Follow paper methods outlined in this report
[x] Troubleshoot graph learning
This is necessary to compare algorithmic learning vs. the knowledge informed directed acyclic graph in Issue #23
Rsmax2, mmhc, and h2pc yielded incomplete graphs. Testing hill climbing and tabu greedy searching.
hc and tabu searches work best. Whitelisted and blacklisted arcs are updated in script.
Implemented changes in code.
[x] Follow paper methods outlined in this report
[x] Troubleshoot graph learning
This is necessary to compare algorithmic learning vs. the knowledge informed directed acyclic graph in Issue #23