Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Structure Learning of Bayesian Networks with Bounded Treewidth Using Mixed Integer Linear Programming
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).
2014 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesisAlternative title
Strukturinlärning av Bayesianska nätverk av begränsad trävidd med hjälp av heltalsprogrammering (Swedish)
Abstract [en]

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 networks with bounded treewidth is studied in this thesis. This is solved by reducing the problem to a mixed integer linear problem using several formulation for the structure of the Bayesian network as well as for bounding the treewidth of the structure. Solving the problem in this way gives an algorithm known as an anytime algorithm which can be aborted during the run and return a solution as well as an upper bound for the value of the best possible solution. Tests show that several of these formulations are of practical use as implementations of them prove solutions to be optimal or nearly optimal for several data sets.

Place, publisher, year, edition, pages
2014.
Series
TRITA-MAT-E, 2014:45
National Category
Discrete Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-148972OAI: oai:DiVA.org:kth-148972DiVA: diva2:742119
Subject / course
Mathematics
Educational program
Master of Science - Mathematics
Supervisors
Examiners
Available from: 2014-08-31 Created: 2014-08-16 Last updated: 2014-08-31Bibliographically approved

Open Access in DiVA

fulltext(608 kB)258 downloads
File information
File name FULLTEXT01.pdfFile size 608 kBChecksum SHA-512
2ac58e94b5769412eb68f10811869b418dd8418649d9157cb845fd2cb67cf980b1ec5ff1931ec0e01b1ee2e1cc948bdd28bd6e9f3a46810f647b059cc9f2fc1e
Type fulltextMimetype application/pdf

By organisation
Mathematics (Div.)
Discrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 258 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 324 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf