Article
CausNet : Generational orderings based search for optimal Bayesian networks via dynamic programming with parent set constraints
2022-07-18
Abstract excerpt
<h4>Background: </h4> Finding a globally optimal Bayesian Network using exhaustive search is a problem with super-exponential complexity, which severely restricts the number of variables that it can work for. We implement a dynamic programming based algorithm with built-in dimensionality reduction and parent set identification. This reduces the search space drastically and can be applied to large-dimensional data....
Topics
Open a Topic to create a Post that cites this publication.
Identifiers and source
- Literature Corpus work
- 4b4c47eb-9bb0-55b9-b2b0-f39f5c980b97
- DOI
- 10.21203/rs.3.rs-1867899/v1
