Chain Graphs: Interpretations, Expressiveness and Learning Algorithms
2016 (English)Doctoral thesis, comprehensive summary (Other academic)
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.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1748
Chain Graphs, Probabilitstic Grapical Models
IdentifiersURN: urn:nbn:se:liu:diva-125921DOI: 10.3384/diss.diva-125921ISBN: 978-91-7685-818-9 (Print)OAI: oai:DiVA.org:liu-125921DiVA: diva2:910177
2016-04-29, Visionen, B-House, Entrance 27, Campus Valla, Linköping, 13:15 (English)
Vomlel, Jirka, Doctor
Peña, M. Jose, Dr.Shahmehri, Nahid, Professor
FunderSwedish Research Council, 2010-4808
List of papers