CausNet-partial: 'Partial Generational Orderings' based search for optimal sparse Bayesian networks via dynamic programming with parent set constraints.
In our recent work, we developed a novel dynamic programming algorithm to find optimal Bayesian networks with parent set constraints. This 'generational orderings' based dynamic programming algorithm-CausNet-efficiently searches the space of possible Bayesian networks. The method is design...
Saved in:
| Main Authors: | Nand Sharma, Joshua Millstein |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2025-01-01
|
| Series: | PLoS ONE |
| Online Access: | https://doi.org/10.1371/journal.pone.0324622 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Efficient Algorithm for Decomposition of Partially Ordered Sets
by: Elsayed Badr, et al.
Published: (2023-01-01) -
Constant Rate Distributions on Partially Ordered Sets
by: Kyle Siegrist
Published: (2010-01-01) -
On the cardinality of layers in some partially ordered sets
by: T.V. Andreeva, et al.
Published: (2020-09-01) -
Natural Partial Orders on Transformation Semigroups with Fixed Sets
by: Yanisa Chaiya, et al.
Published: (2016-01-01) -
A Comparison of Sparse Partial Least Squares and Elastic Net in Wavelength Selection on NIR Spectroscopy Data
by: Guang-Hui Fu, et al.
Published: (2019-01-01)