MathsGee Answers is Zero-Rated (You do not need data to access) on: Telkom | Dimension Data | Rain | MWEB
First time here? Checkout the FAQs!
x
Institutions: Global | Authors |Cars | Courseware |Ekurhuleni Libraries | Joburg Libraries | Startups | Tools |Tshwane Libraries | Math Worksheets | Visual Statistics

MathsGee is Zero-Rated (You do not need data to access) on: Telkom |Dimension Data | Rain | MWEB

0 like 0 dislike
5 views
How is the PC algorithm used for independence-based causal discovery?
in Data Science by Diamond (62,188 points) | 5 views

1 Answer

0 like 0 dislike
Best answer
The PC algorithm starts with a complete, undirected graph and deletes recursively edges based on conditional independence decisions.

For example, the edge between $A$ and $B$ is removed if we can find a set $S$ that does not include $A$ and $B$, and when conditioning on $S$, $A$ and $B$ are independent. The PC algorithm has been implemented in various open-source sofware such as TETRAD, pcalg, and bnlearn, and has become a reliable tool for causal explorations.

source: https://arxiv.org/pdf/1502.02454.pdf
by Diamond (62,188 points)

Welcome to MathsGee Answers, a free online study network where students can ask, answer, and explore 24/7 for improved outcomes.



MathsGee Supporting City of Joburg

Enter your email address:

Registered Members Online
MathsGee Tools

Math Worksheet Generator

Math Algebra Solver

Trigonometry Simulations

Vectors Simulations

Matrix Arithmetic Simulations

Matrix Transformations Simulations

Quadratic Equations Simulations

Probability & Statistics Simulations

PHET Simulations

Visual Statistics

Interactive Courseware

ZeroEd Search Engine

Article Rewriter Tool

Word Counter Tool

Other Tools

STEM Gender Equality | ZOOM | Slack | eBook