Learning bayesian network structure using lp relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference problem where the variables specify the choice of parents for each node in the graph. The key combinatorial difficult...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Society for Artificial Intelligence and Statistics
2011
|
| Online Access: | http://hdl.handle.net/1721.1/66317 https://orcid.org/0000-0002-2199-0379 |