Fast causal division for supporting robust causal discovery Online publication date: Thu, 10-Sep-2020
by Guizhen Mai; Shuiguo Peng; Yinghan Hong; Pinghua Chen
International Journal of Information and Computer Security (IJICS), Vol. 13, No. 3/4, 2020
Abstract: Discovering the causal relationship from the observational data is a key problem in many scientific research fields. However, it is not easy to detect the causal relationship by using general causal discovery methods among large scale data, due to the curse of the dimension. Although some causal dividing frameworks are proposed to alleviate these problems, they are, in fact, also faced with high dimensional problems. In this work, we propose a split-and-merge method for causal discovery. The original dataset is firstly divided into two smaller subsets by using low-order CI tests, and then the subsets are further divided into a set of smaller subsets. For each subset, we employ the existing causal learning method to discovery the corresponding structures, by combined all these structures, we finally obtain the complete causal structure. Various experiments are conducted to verify that compared with other methods, it returns more reliable results and has strong applicability.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Computer Security (IJICS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook