v0.5.2

CausalInference v0.5.2

Diff since v0.5.1

Merged pull requests:

• added code to plot output of FCI algorithm (#30) (@schnirz)

v0.5.1

CausalInference v0.5.1

Diff since v0.5.0

Merged pull requests:

• fixed LightGraphs deprecation warning (#26) (@schnirz)
• Plot pc graph (#27) (@schnirz)
• CompatHelper: add new compat entry for "TikzGraphs" at version "1.1" (#28) (@github-actions[bot])

v0.5.0

CausalInference v0.5.0

Diff since v0.4.0

Closed issues:

• Use new iteration protocol (#4)
• changes to documentation code (#6)
• Data for example unavailable (#12)

Merged pull requests:

• Pearl example as test (#7) (@mschauer)
• CMI tests & tables (#8) (@schnirz)
• WIP: FCI algorithm (#9) (@schnirz)
• WIP: update README.md and add examples (#13) (@schnirz)
• Create Project (#15) (@mschauer)
• Install TagBot as a GitHub Action (#16) (@JuliaTagBot)
• CompatHelper: add new compat entry for "Distributions" at version "0.23" (#17) (@github-actions[bot])
• CompatHelper: add new compat entry for "Tables" at version "1.0" (#18) (@github-actions[bot])
• CompatHelper: add new compat entry for "Distances" at version "0.8" (#19) (@github-actions[bot])
• CompatHelper: add new compat entry for "SpecialFunctions" at version "0.10" (#20) (@github-actions[bot])
• CompatHelper: add new compat entry for "LightGraphs" at version "1.3" (#21) (@github-actions[bot])
• CompatHelper: add new compat entry for "Combinatorics" at version "1.0" (#22) (@github-actions[bot])
• CompatHelper: add new compat entry for "NearestNeighbors" at version "0.4" (#23) (@github-actions[bot])
• CompatHelper: add new compat entry for "MetaGraphs" at version "0.6" (#24) (@github-actions[bot])

(Pre-)release 0.4.0

Compatibility with Julia versions 1.0 and 0.7, dropping 0.6 support.

Inital (pre-)release v0.3.0

CausalInference.jl

Julia package for causal inference, graphical models and structure learning with the PC algorithm. This package contains for now the classical PC algorithm, tested on random DAGs by comparing the result of the PC algorithm using the d-separation oracle with CPDAGs computed with Chickering's DAG->CPDAG conversion algorithm (implemented as dsep and cpdag in this package).

See the documentation for other implemented functionality and issue #1 (Roadmap/Contribution) for coordination of the development.

The algorithms use the Julia package LightGraphs. Graphs are represented by sorted adjacency lists (vectors in the implemention). CPDAGs are just DiGraphs where unoriented edges are represented by both a forward and a backward directed edge.

References

• D. M. Chickering: Learning Equivalence Classes of Bayesian-Network Structures. Journal of Machine Learning Research 2 (2002), 445-498.
• D. Colombo, M. H. Maathuis: Order-Independent Constraint-Based Causal Structure Learning. Journal of Machine Learning Research 15 (2014), 3921-3962.