University of Jyväskylä | JYX Digital Repository

  • English  | Give feedback |
    • suomi
    • English
 
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
View Item 
  • JYX
  • Opinnäytteet
  • Väitöskirjat
  • View Item
JYX > Opinnäytteet > Väitöskirjat > View Item

Improving identification algorithms in causal inference

Thumbnail
View/Open
919.6 Kb

Downloads:  
Show download detailsHide download details  
Published in
Report / University of Jyväskylä, Department of Mathematics and Statistics
Authors
Tikka, Santtu
Date
2018
Discipline
Tilastotiede

 
Causal models provide a formal approach to the study of causality. One of the most useful features of causal modeling is that it enables one to make causal claims about a phenomenon using observational data alone under suitable conditions. This feature enables the analysis of interventions that may be infeasible to conduct in the real world for practical or ethical reasons. The uncertainty associated with the variables of interest is taken into account by including a probability distribution in the causal model, making it is possible to study the effects of external interventions by examining how this distribution is changed by the action. The probability distribution of a specific variable in a causal model perturbed by an outside intervention is the causal effect of that intervention on the variable. One of the most fundamental problems of causal inference is determining whether a causal effect can be uniquely expressed in terms of the joint probability distribution over the observed variables in a given causal model. Causal effects that can be expressed in this way are called identifiable and they serve as the link between observational and experimental information. Complete solutions to the identifiability problem take the form of an algorithm that produces an expression in terms of observed quantities whenever the causal effect given as input is identifiable. However, completeness in this context refers only to the correctness and exhaustiveness of the methods. The formulas obtained as output from identifiability algorithms are often impractical and unnecessarily complicated. The thesis augments the pre-existing identifiability methodology by providing a simplification procedure that drastically improves the complicated outputs in many cases. Simplification also has practical benefits when statistical estimation is considered if variables affected by bias or missing data no longer appear in the simplified expression. The thesis also introduces a new method called pruning, which aims to eliminate variables that are unnecessary for the identification task from the causal model itself. Finally, a variety of identification algorithms are implemented more complicated settings, such as when data are available from multiple domains. The methods are provided through the R package “causaleffect” ...
Publisher
University of Jyväskylä
ISBN
978-951-39-7519-7
ISSN Search the Publication Forum
1457-8905
Keywords
kausaliteetti päättely muuttujat mallit graafit todennäköisyys algoritmit R-kieli
URI

http://urn.fi/URN:ISBN:978-951-39-7519-7

Metadata
Show full item record
Collections
  • Väitöskirjat [3176]

Related items

Showing items with similar title or keywords.

  • Enhancing Identification of Causal Effects by Pruning 

    Tikka, Santtu; Karvanen, Juha (MIT Press, 2018)
    Causal models communicate our assumptions about causes and e ects in real-world phenomena. Often the interest lies in the identification of the e ect of an action which means deriving an expression from the observed ...
  • Causal Effect Identification from Multiple Incomplete Data Sources : A General Search-Based Approach 

    Tikka, Santtu; Hyttinen, Antti; Karvanen, Juha (Foundation for Open Access Statistic, 2021)
    Causal effect identification considers whether an interventional probability distribution can be uniquely determined without parametric assumptions from measured source distributions and structural knowledge on the generating ...
  • Simplifying Probabilistic Expressions in Causal Inference 

    Tikka, Santtu; Karvanen, Juha (MIT Press, 2017)
    Obtaining a non-parametric expression for an interventional distribution is one of the most fundamental tasks in causal inference. Such an expression can be obtained for an identifiable causal effect by an algorithm or ...
  • Kausaalivaikutusten identifiointi algoritmisesti 

    Tikka, Santtu (2015)
    Kokeelliset tutkimukset ovat perinteinen lähestymistapa kausaalisuuden tutkimiseen tilastotieteessä. Ideaalisessa tilanteessa kiinnostavat muuttujat voidaan mitata halutulla tarkkuudella ja mahdolliset sekoittavat tekijät ...
  • The spanning tree based approach for solving the shortest path problem in social graphs 

    Eremeev, Andrei (2016)
    This thesis is devoted to the shortest path problem in social graphs. Social graphs represent individuals and social relationships between them. As for social networking sites, their users are represented as vertices of ...
  • Browse materials
  • Browse materials
  • Articles
  • Conferences and seminars
  • Electronic books
  • Historical maps
  • Journals
  • Tunes and musical notes
  • Photographs
  • Presentations and posters
  • Publication series
  • Research reports
  • Research data
  • Study materials
  • Theses

Browse

All of JYXCollection listBy Issue DateAuthorsSubjectsPublished inDepartmentDiscipline

My Account

Login

Statistics

View Usage Statistics
  • How to publish in JYX?
  • Self-archiving
  • Publish Your Thesis Online
  • Publishing Your Dissertation
  • Publication services

Open Science at the JYU
 
Data Protection Description

Accessibility Statement

Unless otherwise specified, publicly available JYX metadata (excluding abstracts) may be freely reused under the CC0 waiver.
Open Science Centre