Causal Data Science with Directed Acyclic Graphs
- 4.7
-
![]()
![]()
![]()
![]()
![]()
Brief Introduction
Get to know the modern tools for causal inference from machine learning and AI, with many practical examples in RDescription
This course offers an introduction into causal data science with directed acyclic graphs (DAG). DAGs combine mathematical graph theory with statistical probability concepts and provide a powerful approach to causal reasoning. Originally developed in the computer science and artificial intelligence field, they recently gained more and more traction also in other scientific disciplines (such as, e.g., machine learning, economics, finance, health sciences, and philosophy). DAGs allow to check the validity of causal statements based on intuitive graphical criteria, that do not require any algebra. In addition, they open up the possibility to completely automatize the causal inference task with the help of special identification algorithms. As an encompassing framework for causal thinking, DAGs are becoming an essential tool for everyone interested in data science and machine learning.
The course provides a good overview of the theoretical advances that have been made in causal data science during the last thirty year. The focus lies on practical applications of the theory and students will be put into the position to apply causal data science methods in their own work. Hands-on examples, discussed in the statistical software package R, will guide through the presented material. There are no particular prerequisites for participating. However, a good working knowledge in probability and basic programming skills are a benefit.
Requirements
- Requirements
- Basic knowledge of probability and statistcs
- Basic programming skills would be an advantage
Paul Hünermund
4.7 Raiting
Causal Data Science with Directed Acyclic Graphs
- 4.7
-
![]()
![]()
![]()
![]()
![]()
Get to know the modern tools for causal inference from machine learning and AI, with many practical examples in R g....
Algorithms, Part II
- 4.9
-
![]()
![]()
![]()
![]()
![]()
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations....
A Crash Course in Causality: Inferring Causal Effects from Observational Data
- 4.7
-
![]()
![]()
![]()
![]()
![]()
We have all heard the phrase “correlation does not equal causation. ” What, then, does equal causation? This course aims to answer that question and more!...
Discrete Math and Analyzing Social Graphs
- 4.4
-
![]()
![]()
![]()
![]()
![]()
The main goal of this course is to introduce topics in Discrete Mathematics relevant to Data Analysis. Next, we will apply our knowledge in combinatorics to study basic Probability Theory....
