Skip to main content
. Author manuscript; available in PMC: 2019 May 6.
Published in final edited form as: Proc IEEE Int Conf Data Min. 2017 Dec 18;2017:913–918. doi: 10.1109/ICDM.2017.114

Algorithm 1.

Detection of Changing Modules and Recovery of Causal Skeleton

1) Build a complete undirected graph UC on the variable set V ∪ {C}.
2) (Detection of changing modules) For each i, test for the marginal and conditional independence between Vi and C. If they are independent given a subset of {Vk | k ≠ i}, remove the edge between Vi and C in UC.
3) (Recovery of causal skeleton) For every i ≠ j, test for the marginal and conditional independence between Vi and Vj. If they are independent given a subset of {Vk | k ≠ i, k ≠ j} ∪ {C}, remove the edge between Vi and Vj in UC.