Article
CausNet-partial : `Partial Generational Orderings' based search for optimal sparse Bayesian networks via dynamic programming with parent set constraints
2024-03-07
Abstract excerpt
<title>Abstract</title> <p><bold>Background</bold>: In our recent work, we developed a novel dynamic programming algorithm to find optimal Bayesian networks (BNs) with parent set constraints. This ‘generational orderings’ based dynamic programming search algorithm - CausNet - efficiently searches the space of possible BNs given the possible parent sets. The algorithm supports both continuous and categorical data,...
Topics
Open a Topic to create a Post that cites this publication.
Identifiers and source
- Literature Corpus work
- b560bdc3-dd87-5c81-883f-da8f5d2209ae
- DOI
- 10.21203/rs.3.rs-4021074/v1
