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
Reasoning with Alternative Acyclic Directed Mixed Graphs
Linköping University, Department of Computer and Information Science, The Division of Statistics and Machine Learning. Linköping University, Faculty of Science & Engineering. (STIMA)
2018 (English)In: Behaviormetrika, ISSN 0385-7417, E-ISSN 1349-6964, Vol. 45, no 2, p. 389-422Article in journal (Refereed) Published
Abstract [en]

Acyclic directed mixed graphs (ADMGs) are the graphs used by Pearl (Causality: models, reasoning, and inference. Cambridge University Press, Cambridge, 2009) for causal effect identification. Recently, alternative acyclic directed mixed graphs (aADMGs) have been proposed by Peña (Proceedings of the 32nd conference on uncertainty in artificial intelligence, 577–586, 2016) for causal effect identification in domains with additive noise. Since the ADMG and the aADMG of the domain at hand may encode different model assumptions, it may be that the causal effect of interest is identifiable in one but not in the other. Causal effect identification in ADMGs is well understood. In this paper, we introduce a sound algorithm for identifying arbitrary causal effects from aADMGs. We show that the algorithm follows from a calculus similar to Pearl’s do-calculus. Then, we turn our attention to Andersson–Madigan–Perlman chain graphs, which are a subclass of aADMGs, and propose a factorization for the positive discrete probability distributions that are Markovian with respect to these chain graphs. We also develop an algorithm to perform maximum likelihood estimation of the factors in the factorization.

Place, publisher, year, edition, pages
Tokyo, Japan: Nihon Kodo Keiryo Gakkai , 2018. Vol. 45, no 2, p. 389-422
Keywords [en]
Causality, Causal effect identification, Acyclic directed mixed graphs, Factorization, Maximum likelihood estimation
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-159350DOI: 10.1007/s41237-018-0051-2OAI: oai:DiVA.org:liu-159350DiVA, id: diva2:1341382
Available from: 2019-08-08 Created: 2019-08-08 Last updated: 2019-08-15Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Peña, Jose M.

Search in DiVA

By author/editor
Peña, Jose M.
By organisation
The Division of Statistics and Machine LearningFaculty of Science & Engineering
In the same journal
Behaviormetrika
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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