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

Direct link
Cite
Citation style
  • apa
  • 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
Representing independence models with elementary triplets
Linköping University, Department of Computer and Information Science, The Division of Statistics and Machine Learning. Linköping University, Faculty of Science & Engineering.
2017 (English)In: International Journal of Approximate Reasoning, ISSN 0888-613X, E-ISSN 1873-4731, Vol. 88, p. 587-601Article in journal (Refereed) Published
Abstract [en]

In an independence model, the triplets that represent conditional independences between singletons are called elementary. It is known that the elementary triplets represent the independence model unambiguously under some conditions. In this paper, we show how this representation helps performing some operations with independence models, such as finding the dominant triplets or a minimal independence map of an independence model, or computing the union or intersection of a pair of independence models, or performing causal reasoning. For the latter, we rephrase in terms of conditional independences some of Pearls results for computing causal effects. (C) 2016 Elsevier Inc. All rights reserved.

Place, publisher, year, edition, pages
ELSEVIER SCIENCE INC , 2017. Vol. 88, p. 587-601
Keywords [en]
Independence models; Elementary triplets; Causality
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-140950DOI: 10.1016/j.ijar.2016.12.005ISI: 000407655600030OAI: oai:DiVA.org:liu-140950DiVA, id: diva2:1142426
Conference
10th Workshop on Uncertainty Processing (WUPES)
Available from: 2017-09-19 Created: 2017-09-19 Last updated: 2018-01-13

Open Access in DiVA

fulltext(456 kB)265 downloads
File information
File name FULLTEXT01.pdfFile size 456 kBChecksum SHA-512
e0602cc0dbf9c0cbc8dd2527ea83d41869e98750272003e3c8003e919f940f5c8841c4cfcfae4c92ec22bde11703ed815410ba78364f42f587b31c018737b522
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Pena, Jose M
By organisation
The Division of Statistics and Machine LearningFaculty of Science & Engineering
In the same journal
International Journal of Approximate Reasoning
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 265 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

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 193 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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