liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
The Maximum Minimum Parents and Children Algorithm
Linköping University, Department of Mathematics, Mathematical Statistics .
2010 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Given a random sample from a multivariate probability distribution p, the maximum minimum parents and children algorithm locates the skeleton of the directed acyclic graph of a Bayesian network for p provided that there exists a faithful Bayesian network and that the dependence structure derived from data is the same as that of the underlying probability distribution.

The aim of this thesis is to examine the consequences when one of these conditions is not fulfilled. There are some circumstances where the algorithm works well even if there does not exist a faithful Bayesian network, but there are others where the algorithm fails.

The MMPC tests for conditional independence between the variables and assumes that if conditional independence is not rejected, then the conditional independence statement holds. There are situations where this procedure leads to conditional independence being accepted that contradict conditional dependence relations in the data. This leads to edges being removed from the skeleton that are necessary for representing the dependence structure of the data.

Place, publisher, year, edition, pages
2010. , 33 p.
Keyword [en]
Bayesian networks, Structure learning, Faithfulness
National Category
Probability Theory and Statistics
Identifiers
URN: urn:nbn:se:liu:diva-56767ISRN: LiTH - MAT - EX - - 2010 / 09 - - SEOAI: oai:DiVA.org:liu-56767DiVA: diva2:332341
Presentation
(English)
Uppsok
Physics, Chemistry, Mathematics
Supervisors
Examiners
Available from: 2010-08-09 Created: 2010-06-03 Last updated: 2010-08-09Bibliographically approved

Open Access in DiVA

fulltext(306 kB)1512 downloads
File information
File name FULLTEXT01.pdfFile size 306 kBChecksum SHA-512
b29e0cf4d1e86bca59669038b0986b13402eca037e2dd85b17b76e8fb05f758e059b71dce4e83cdc8c2d66e7e2a734da0ced550605e86c2d0ec1580435ce641d
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Petersson, Mikael
By organisation
Mathematical Statistics
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 1512 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: 419 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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