Evidence map›Paper›PMID 28331847›Full record

ArticleData2017

Learning Parsimonious Classification Rules from Gene Expression Data Using Bayesian Networks with Local Structure.

Jonathan Lyle Lustgarten, Jeya Balaji Balasubramanian, Shyam Visweswaran, Vanathi Gopalakrishnan

Abstract read
In one paragraph

Article in Data, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

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

3 citing papers in PubMed.

  1. Review
  2. Article
  3. 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

4 authors.

Jonathan Lyle LustgartenRed Bank Veterinary Hospital / 2051 Briggs Rd, Mt Laurel, NJ 08054, USA.
Jeya Balaji BalasubramanianIntelligent Systems Program, University of Pittsburgh / 5113 Sennott Square, 210 South Bouquet Street, Pittsburgh, PA 15260, USA.
Shyam VisweswaranIntelligent Systems Program, University of Pittsburgh / 5113 Sennott Square, 210 South Bouquet Street, Pittsburgh, PA 15260, USA; Department of Biomedical Informatics, University of Pittsburgh / 5607 Baum Boulevard, Pittsburgh, PA 15206, USA.
Vanathi GopalakrishnanIntelligent Systems Program, University of Pittsburgh / 5113 Sennott Square, 210 South Bouquet Street, Pittsburgh, PA 15260, USA; Department of Biomedical Informatics, University of Pittsburgh / 5607 Baum Boulevard, Pittsburgh, PA 15206, USA.

Funding

The internship in Biomedical Research, Informatics, and Computer Science (iBRIC): Biomedical Informatics and Data Science research experiences for students from Minority Serving InstitutionsT15LM007059 · NLM · UNIVERSITY OF PITTSBURGH AT PITTSBURGH · PI HARRY S HOCHHEISER · 1987 to 2026
$23.9M
Development and Evaluation of a Learning Electronic Medical Record SystemR01LM012095 · NLM · UNIVERSITY OF PITTSBURGH AT PITTSBURGH · PI VISWESWARAN, SHYAM · 2015 to 2018
$1.8M
Transfer Rule Learning with Functional Mapping for Integrative Modeling of Panomics DataR01GM100387 · NIGMS · UNIVERSITY OF PITTSBURGH AT PITTSBURGH · PI GOPALAKRISHNAN, VANATHI · 2012 to 2018
$1.8M
NIGMS NIH HHS R01 GM100387NLM NIH HHS R01 LM012095NLM NIH HHS T15 LM007059
6 · The paper itself

Abstract

The comprehensibility of good predictive models learned from high-dimensional gene expression data is attractive because it can lead to biomarker discovery. Several good classifiers provide comparable predictive performance but differ in their abilities to summarize the observed data. We extend a Bayesian Rule Learning (BRL-GSS) algorithm, previously shown to be a significantly better predictor than other classical approaches in this domain. It searches a space of Bayesian networks using a decision tree representation of its parameters with global constraints, and infers a set of IF-THEN rules. The number of parameters and therefore the number of rules are combinatorial to the number of predictor variables in the model. We relax these global constraints to a more generalizable local structure (BRL-LSS). BRL-LSS entails more parsimonious set of rules because it does not have to generate all combinatorial rules. The search space of local structures is much richer than the space of global structures. We design the BRL-LSS with the same worst-case time-complexity as BRL-GSS while exploring a richer and more complex model space. We measure predictive performance using Area Under the ROC curve (AUC) and Accuracy. We measure model parsimony performance by noting the average number of rules and variables needed to describe the observed data. We evaluate the predictive and parsimony performance of BRL-GSS, BRL-LSS and the state-of-the-art C4.5 decision tree algorithm, across 10-fold cross-validation using ten microarray gene-expression diagnostic datasets. In these experiments, we observe that BRL-LSS is similar to BRL-GSS in terms of predictive performance, while generating a much more parsimonious set of rules to explain the same observed data. BRL-LSS also needs fewer variables than C4.5 to explain the data with similar predictive performance. We also conduct a feasibility study to demonstrate the general applicability of our BRL methods on the newer RNA sequencing gene-expression data.

Indexed as

bayesian networksgene expression dataparsimonyrule based models

Identifiers

PMID28331847
PMCPMC5358670

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.