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
Chain Graph Interpretations and Their Relations, Extended Version
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
2013 (English)In: Proceedings of the 12th European Conference, ECSQARU 2013, Utrecht, The Netherlands, July 8-10, 2013 / [ed] Linda C. van der Gaag, Springer Berlin/Heidelberg, 2013, 510-521 p.Conference paper, Published paper (Refereed)
Abstract [en]

This paper deals with different chain graph interpretations and the relations between them in terms of representable independence models. Specifically, we study the Lauritzen-Wermuth-Frydenberg, Andersson-Madigan-Perlman and multivariate regression interpretations and present the necessary and sufficient conditions for when a chain graph of one interpretation can be perfectly translated into a chain graph of another interpretation. Moreover, we also present a feasible split for the Andersson-Madigan-Perlman interpretation with similar features as the feasible splits presented for the other two interpretations.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2013. 510-521 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; Vol. 7958
Keyword [en]
Chain Graphs, Lauritzen-Wermuth-Frydenberg interpretation, Andersson-Madigan-Perlman interpretation, multivariate regression interpretation
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-105814DOI: 10.1007/978-3-642-39091-3_43ISBN: 978-3-642-39090-6 (print)ISBN: 978-3-642-39091-3 (print)OAI: oai:DiVA.org:liu-105814DiVA: diva2:710809
Conference
The 12th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty July 7th -10th, Utrecht, The Netherlands
Note

Awarded best student paper award at ECSQARU 2013.

Available from: 2014-04-08 Created: 2014-04-08 Last updated: 2015-05-28Bibliographically 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

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Sonntag, DagPeña, Jose M.

Search in DiVA

By author/editor
Sonntag, DagPeña, Jose M.
By organisation
Database and information techniquesThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 325 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