A Fast PC Algorithm for High Dimensional Causal Discovery with Multi-Core PCs
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Discovering causal relationships from observational data is a crucial problem and it has applications in many research areas. The PC algorithm is the state-of-the-art constraint based method for causal discovery. However, runtime of the PC algorithm, in the worst-case, is exponential to the number of nodes (variables), and thus it is inefficient when being applied to high dimensional data, e.g., gene expression datasets. On another note, the advancement of computer hardware in the last decade has resulted in the widespread availability of multi-core personal computers. There is a significant motivation for designing a parallelized PC algorithm that is suitable for personal computers and does not require end users' parallel computing knowledge beyond their competency in using the PC algorithm. In this paper, we develop parallel-PC, a fast and memory efficient PC algorithm using the parallel computing technique. We apply our method to a range of synthetic and real-world high dimensional datasets. Experimental results on a dataset from the DREAM 5 challenge show that the original PC algorithm could not produce any results after running more than 24 hours; meanwhile, our parallel-PC algorithm managed to finish within around 12 hours with a 4-core CPU computer, and less than six hours with a 8-core CPU computer. Furthermore, we integrate parallel-PC into a causal inference method for inferring miRNA-mRNA regulatory relationships. The experimental results show that parallel-PC helps improve both the efficiency and accuracy of the causal inference algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Causality: Models, Reasoning, and Inference
Pearl, J. (2009) · doi:10.1017/cbo9780511803161 · Cited by 11,653
Combinatorial microRNA target predictions
Krek, A., Grün, D., Poy, M. N., Wolf, R., Rosenberg, L., Epstein, E. J., MacMenamin, P., da Piedade, I., Gunsalus, K. C., Stoffel, M., et al. (2005) · Nature Genetics · doi:10.1038/ng1536 · Cited by 4,603
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (2001) · doi:10.7551/mitpress/1754.001.0001 · Cited by 4,521
MicroRNA targets in Drosophila
Enright, A. J., John, B., Gaul, U., Tuschl, T., Sander, C., & Marks, D. S. (2003) · Genome Biology · doi:10.1186/gb-2003-5-1-r1 · Cited by 3,597 · cited 1×
“In the first stream, researchers identified miRNA-mRNA interactions using sequence data [49], [50], [51].”
MethodLearning Bayesian Networks: The Combination of Knowledge and Statistical Data
Heckerman, D., Geiger, D., & Chickering, D. M. (1994) · Uncertainty Proceedings 1994 · doi:10.1016/b978-1-55860-332-5.50042-0 · Cited by 261
Predicting causal effects in large-scale systems from observational data
Maathuis, M. H., Colombo, D., Kalisch, M., & Bühlmann, P. (2010) · Nature Methods · doi:10.1038/nmeth0410-247 · Cited by 217
Cited by
D’ya Like DAGs? A Survey on Structure Learning and Causal Discovery
Vowels, M. J., Camgoz, N. C., & Bowden, R. (2023) · ACM Computing Surveys · doi:10.1145/3527154 · Cited by 237
A Survey on Causal Discovery: Theory and Practice
Zanga, A., Ozkirimli, E., & Stella, F. (2022) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2022.09.004 · Cited by 129
Qiu, J., Du, Q., Yin, K., Zhang, S.-L., & Qian, C. (2020) · Applied Sciences · doi:10.3390/app10062166 · Cited by 96
“However, as far as we know, this problem can be improved by introducing parallel computing to the PC algorithm [29].”
BackgroundMining causality of network events in log data
Kobayashi, S., Otomo, K., Fukuda, K., & Esaki, H. (2018) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2017.2778096 · Cited by 63
Causal analysis of network logs with layered protocols and topology knowledge
Kobayashi, S., Otomo, K., & Fukuda, K. (2019) · 2019 15th International Conference on Network and Service Management (CNSM) · doi:10.23919/cnsm46954.2019.9012718 · Cited by 13
Metadata
- Authors
- Le, T. D., Hoang, T., Li, J., Liu, L., Liu, H., & Hu, S.
- Venue
- IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Published
- 2019-09-01
- Volume
- 16
- Issue
- 5
- Pages
- 1483-1495
- ISSN
- 1545-5963 (ISSN-L)
- 1557-9964
- 2374-0043
- OpenAlex
- W2396961413
- Cited by
- 135
- References
- 7
- FWCI
- 4.70
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Fast PC Algorithm for High Dimensional Causal Discovery with Multi-Core PCs. https://app.cochat.ai/papers/10.1109/tcbb.2016.2591526
- The paper
- Le, T. D., Hoang, T., Li, J., Liu, L., Liu, H., & Hu, S. (2019). A Fast PC Algorithm for High Dimensional Causal Discovery with Multi-Core PCs. IEEE/ACM Transactions on Computational Biology and Bioinformatics. https://doi.org/10.1109/tcbb.2016.2591526
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.