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
An inclusion optimal algorithm for chain graph structure learning: with supplement
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology. (ADIT)
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
CLC bio, a Quiagen company, Denmark.
2014 (English)In: Proceedings of the 17th International Conference on Arti-cial Intelligence and Statistics, 2014, 778-786 p.Conference paper, Published paper (Other academic)
Abstract [en]

This paper presents and proves an extension of Meek’s conjecture to chain graphs under the Lauritzen-Wermuth-Frydenberg interpretation. The proof of the conjecture leads to the development of a structure learning algorithm that finds an inclusion optimal chain graph for any given probability distribution satisfying the composition property. Finally, the new algorithm is experimentally evaluated.

Place, publisher, year, edition, pages
2014. 778-786 p.
Series
JMLR Workshop and Conference Proceedings, Vol. 33
Keyword [en]
Chain Graph, Lauritzen-Wermuth-Frydenberg interpretation, Learning
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:liu:diva-105816OAI: oai:DiVA.org:liu-105816DiVA: diva2:710842
Conference
17th International Conference on Artificial Intelligence and Statistics April 22-25, 2014, Reykjavik, Iceland
Available from: 2014-04-08 Created: 2014-04-08 Last updated: 2016-03-29Bibliographically approved
In thesis
1. A Study of Chain Graph Interpretations
Open this publication in new window or tab >>A Study of Chain Graph Interpretations
2014 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Probabilistic graphical models are today one of the most well used architectures for modelling and reasoning about knowledge with uncertainty. The most widely used subclass of these models is Bayesian networks that has found a wide range of applications both in industry and research. Bayesian networks do however have a major limitation which is that only asymmetric relationships, namely cause and eect relationships, can be modelled between its variables. A class of probabilistic graphical models that has tried to solve this shortcoming is chain graphs. It is achieved by including two types of edges in the models, representing both symmetric and asymmetric relationships between the connected variables. This allows for a wider range of independence models to be modelled. Depending on how the second edge is interpreted this has also given rise to dierent chain graph interpretations.

Although chain graphs were first presented in the late eighties the field has been relatively dormant and most research has been focused on Bayesian networks. This was until recently when chain graphs got renewed interest. The research on chain graphs has thereafter extended many of the ideas from Bayesian networks and in this thesis we study what this new surge of research has been focused on and what results have been achieved. Moreover we do also discuss what areas that we think are most important to focus on in further research.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2014. 161 p.
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1647
National Category
Computer Systems
Identifiers
urn:nbn:se:liu:diva-105024 (URN)10.3384/lic.diva-105024 (DOI)978-91-7519-377-9 (ISBN)
Presentation
2014-04-29, Alan Turing, Hus E, Campus Valla, Linköping University, Linköping, 13:15 (English)
Opponent
Supervisors
Funder
Swedish Research Council, 2010-4808
Available from: 2014-04-08 Created: 2014-03-06 Last updated: 2014-04-08Bibliographically approved
2. Chain Graphs: Interpretations, Expressiveness and Learning Algorithms
Open this publication in new window or tab >>Chain Graphs: Interpretations, Expressiveness and Learning Algorithms
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Probabilistic graphical models are currently one of the most commonly used architectures for modelling and reasoning with uncertainty. The most widely used subclass of these models is directed acyclic graphs, also known as Bayesian networks, which are used in a wide range of applications both in research and industry. Directed acyclic graphs do, however, have a major limitation, which is that only asymmetric relationships, namely cause and effect relationships, can be modelled between their variables. A class of probabilistic graphical models that tries to address this shortcoming is chain graphs, which include two types of edges in the models representing both symmetric and asymmetric relationships between the variables. This allows for a wider range of independence models to be modelled and depending on how the second edge is interpreted, we also have different so-called chain graph interpretations.

Although chain graphs were first introduced in the late eighties, most research on probabilistic graphical models naturally started in the least complex subclasses, such as directed acyclic graphs and undirected graphs. The field of chain graphs has therefore been relatively dormant. However, due to the maturity of the research field of probabilistic graphical models and the rise of more data-driven approaches to system modelling, chain graphs have recently received renewed interest in research. In this thesis we provide an introduction to chain graphs where we incorporate the progress made in the field. More specifically, we study the three chain graph interpretations that exist in research in terms of their separation criteria, their possible parametrizations and the intuition behind their edges. In addition to this we also compare the expressivity of the interpretations in terms of representable independence models as well as propose new structure learning algorithms to learn chain graph models from data.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2016. 44 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1748
Keyword
Chain Graphs, Probabilitstic Grapical Models
National Category
Computer Systems
Identifiers
urn:nbn:se:liu:diva-125921 (URN)10.3384/diss.diva-125921 (DOI)978-91-7685-818-9 (ISBN)
Public defence
2016-04-29, Visionen, B-House, Entrance 27, Campus Valla, Linköping, 13:15 (English)
Opponent
Supervisors
Funder
Swedish Research Council, 2010-4808
Available from: 2016-03-29 Created: 2016-03-08 Last updated: 2016-03-29Bibliographically approved

Open Access in DiVA

No full text

Other links

Link to article in full text

Authority records BETA

Peña, Jose M.Sonntag, Dag

Search in DiVA

By author/editor
Peña, Jose M.Sonntag, Dag
By organisation
Database and information techniquesThe Institute of Technology
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 124 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