Evidence map›Paper›PMID 36649070›Full record

ArticleJMIR medical informatics2023

Scalable Causal Structure Learning: Scoping Review of Traditional and Deep Learning Algorithms and New Opportunities in Biomedicine.

Pulakesh Upadhyaya, Kai Zhang, Can Li, Xiaoqian Jiang, Yejin Kim

Abstract readScoping Review
In one paragraph

Article in JMIR medical informatics, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.

0numbers the graph read from it
0cells of the map it votes in
8citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

8 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Contribution of Structure Learning Algorithms in Social Epidemiology: Application to Real-World Data.International journal of environmental research and public health · 2025
    Article
  7. Review
  8. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Pulakesh UpadhyayaSchool of Biomedical Informatics, University of Texas Health Science Center at Houston, HOUSTON, TX, United States.ORCID https://orcid.org/0000-0003-1054-1380
Kai ZhangSchool of Biomedical Informatics, University of Texas Health Science Center at Houston, HOUSTON, TX, United States.ORCID https://orcid.org/0000-0002-4519-609X
Can LiSchool of Biomedical Informatics, University of Texas Health Science Center at Houston, HOUSTON, TX, United States.ORCID https://orcid.org/0000-0003-2867-7833
Xiaoqian JiangSchool of Biomedical Informatics, University of Texas Health Science Center at Houston, HOUSTON, TX, United States.ORCID https://orcid.org/0000-0001-9933-2205
Yejin KimSchool of Biomedical Informatics, University of Texas Health Science Center at Houston, HOUSTON, TX, United States.ORCID https://orcid.org/0000-0001-7815-6310

Funding

Open Health Natural Language Processing CollaboratoryU01TR002062 · NCATS · MAYO CLINIC ROCHESTER · PI JIANG, XIAOQIAN, LIU, HONGFANG · 2017 to 2021
$7.6M
Finding Combinatorial Drug Repositioning Therapy For Alzheimer'S Disease And Related DementiasR01AG066749 · NIA · UNIVERSITY OF TEXAS HLTH SCI CTR HOUSTON · PI JIANG, XIAOQIAN, ZHENG, WENJIN JIM · 2020 to 2024
$4.4M
NCATS NIH HHS U01 TR002062NIA NIH HHS R01 AG066749
6 · The paper itself

Abstract

backgroundCausal structure learning refers to a process of identifying causal structures from observational data, and it can have multiple applications in biomedicine and health care.

objectiveThis paper provides a practical review and tutorial on scalable causal structure learning models with examples of real-world data to help health care audiences understand and apply them.

methodsWe reviewed traditional (combinatorial and score-based) methods for causal structure discovery and machine learning-based schemes. Various traditional approaches have been studied to tackle this problem, the most important among these being the Peter Spirtes and Clark Glymour algorithms. This was followed by analyzing the literature on score-based methods, which are computationally faster. Owing to the continuous constraint on acyclicity, there are new deep learning approaches to the problem in addition to traditional and score-based methods. Such methods can also offer scalability, particularly when there is a large amount of data involving multiple variables. Using our own evaluation metrics and experiments on linear, nonlinear, and benchmark Sachs data, we aimed to highlight the various advantages and disadvantages associated with these methods for the health care community. We also highlighted recent developments in biomedicine where causal structure learning can be applied to discover structures such as gene networks, brain connectivity networks, and those in cancer epidemiology.

resultsWe also compared the performance of traditional and machine learning-based algorithms for causal discovery over some benchmark data sets. Directed Acyclic Graph-Graph Neural Network has the lowest structural hamming distance (19) and false positive rate (0.13) based on the Sachs data set, whereas Greedy Equivalence Search and Max-Min Hill Climbing have the best false discovery rate (0.68) and true positive rate (0.56), respectively.

conclusionsMachine learning-based approaches, including deep learning, have many advantages over traditional approaches, such as scalability, including a greater number of variables, and potentially being applied in a wide range of biomedical applications, such as genetics, if sufficient data are available. Furthermore, these models are more flexible than traditional models and are poised to positively affect many applications in the future.

Indexed as

biomedicinecausal inferencecausal structure discoverydeep learningnetworks

Identifiers

PMID36649070
PMCPMC9890349

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.