Evidence map›Paper›PMID 30649169›Full record

ReviewBriefings in bioinformatics2020

Graph- and rule-based learning algorithms: a comprehensive review of their applications for cancer type classification and prognosis using genomic data.

Saurav Mallik, Zhongming Zhao

Abstract readReview
In one paragraph

Review in Briefings in bioinformatics, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 22 papers.

0numbers the graph read from it
0cells of the map it votes in
22citing 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

22 citing papers in PubMed.

  1. Article
  2. Article
  3. Review
  4. Article
  5. Article
  6. Review
  7. Article
  8. Article
  9. Article
  10. Computational Analysis of High-Dimensional DNA Methylation Data for Cancer Prognosis.Journal of computational biology : a journal of computational molecular cell biology · 2022
    Review
  11. Review
  12. Article
  13. Article
  14. Nextcast: A software suite to analyse and model toxicogenomics data.Computational and structural biotechnology journal · 2022
    Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. 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

2 authors.

Saurav MallikCenter for Precision Health, School of Biomedical Informatics, The University of Texas Health Science Center, Houston.
Zhongming ZhaoCenter for Precision Health, School of Biomedical Informatics, The University of Texas Health Science Center, Houston.

Funding

Transforming dbGaP genetic and genomic data to FAIR-ready by artificial intelligence and machine learning algorithmsR01LM012806 · NLM · UNIVERSITY OF TEXAS HLTH SCI CTR HOUSTON · PI Zhongming Zhao · 2017 to 2026
$3.7M
NLM NIH HHS R01 LM012806
6 · The paper itself

Abstract

Cancer is well recognized as a complex disease with dysregulated molecular networks or modules. Graph- and rule-based analytics have been applied extensively for cancer classification as well as prognosis using large genomic and other data over the past decade. This article provides a comprehensive review of various graph- and rule-based machine learning algorithms that have been applied to numerous genomics data to determine the cancer-specific gene modules, identify gene signature-based classifiers and carry out other related objectives of potential therapeutic value. This review focuses mainly on the methodological design and features of these algorithms to facilitate the application of these graph- and rule-based analytical approaches for cancer classification and prognosis. Based on the type of data integration, we divided all the algorithms into three categories: model-based integration, pre-processing integration and post-processing integration. Each category is further divided into four sub-categories (supervised, unsupervised, semi-supervised and survival-driven learning analyses) based on learning style. Therefore, a total of 11 categories of methods are summarized with their inputs, objectives and description, advantages and potential limitations. Next, we briefly demonstrate well-known and most recently developed algorithms for each sub-category along with salient information, such as data profiles, statistical or feature selection methods and outputs. Finally, we summarize the appropriate use and efficiency of all categories of graph- and rule mining-based learning methods when input data and specific objective are given. This review aims to help readers to select and use the appropriate algorithms for cancer classification and prognosis study.

Indexed as

AlgorithmsGenomicsMachine LearningData MiningDatasets as TopicHumansNeoplasmsPrognosisassociation rule miningcancer classificationcancer prognosisdata set integrationgene signaturegraph mininglearning technique

Identifiers

PMID30649169
PMCPMC7373185

What OpenQuestion holds

Textmetadata
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.