Structure Learning of Bayesian Networks with Bounded Treewidth Using Mixed Integer Linear Programming
When given a Bayesian network, a common use of it is calculating conditional probabilities. This is known as inference. In order to be able to infer effectively, the structure of the Bayesian network is required to have low treewidth. Therefore, the problem of learning the structure of Bayesian netw...
Main Author: | Engardt, Max |
---|---|
Format: | Others |
Language: | English |
Published: |
KTH, Matematik (Avd.)
2014
|
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-148972 |
Similar Items
-
On the treewidths of graphs of bounded degree.
by: Yinglei Song, et al.
Published: (2015-01-01) -
An efficient partitioning oracle for bounded-treewidth graphs
by: Hassidim, Avinatan, et al.
Published: (2012) -
A branch and bound algorithm for integer and mixed-integer linear programs.
by: Missal, Joseph Bannan
Published: (2012) -
A Linear-Time Algorithm for Roman Domination Problem on Bounded Treewidth Graphs
by: Yuan-Hsiang Tsai, et al.
Published: (2007) -
Searching for optimal caterpillars in general and bounded treewidth graphs
by: Khosravani, Masoud
Published: (2011)