Evidence map›Paper›PMID 22166097›Full record

ArticleBMC bioinformatics2011

Leveraging domain information to restructure biological prediction.

Xiaofei Nan, Gang Fu, Zhengdong Zhao, Sheng Liu, Ronak Y Patel, Haining Liu, Pankaj R Daga, Robert J Doerksen, Xin Dang, Yixin Chen and 1 more

Abstract read
In one paragraph

Article in BMC bioinformatics, 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

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

2 citing papers in PubMed.

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

11 authors.

Xiaofei NanDepartment of Computer and Information Science, University of Mississippi, USA.
Gang Fu
Zhengdong Zhao
Sheng Liu
Ronak Y Patel
Haining Liu
Pankaj R Daga
Robert J Doerksen
Xin Dang
Yixin Chen
Dawn Wilkins

Funding

SOURCING, ACQUISITION AND DATABASE COREP20RR021929 · NCRR · UNIVERSITY OF MISSISSIPPI · PI EL-ALFY, ABIR T · 2006 to 2010
$11.1M
RENOVATION OF FOURTH FLOOR OF FASER HALLC06RR014503 · NCRR · UNIVERSITY OF MISSISSIPPI · PI WELLS, BARBARA G · 1999 to 1999
–
NCRR NIH HHS 5P20RR021929NCRR NIH HHS C06 RR-14503-01NCRR NIH HHS P20 RR021929
6 · The paper itself

Abstract

backgroundIt is commonly believed that including domain knowledge in a prediction model is desirable. However, representing and incorporating domain information in the learning process is, in general, a challenging problem. In this research, we consider domain information encoded by discrete or categorical attributes. A discrete or categorical attribute provides a natural partition of the problem domain, and hence divides the original problem into several non-overlapping sub-problems. In this sense, the domain information is useful if the partition simplifies the learning task. The goal of this research is to develop an algorithm to identify discrete or categorical attributes that maximally simplify the learning task.

resultsWe consider restructuring a supervised learning problem via a partition of the problem space using a discrete or categorical attribute. A naive approach exhaustively searches all the possible restructured problems. It is computationally prohibitive when the number of discrete or categorical attributes is large. We propose a metric to rank attributes according to their potential to reduce the uncertainty of a classification task. It is quantified as a conditional entropy achieved using a set of optimal classifiers, each of which is built for a sub-problem defined by the attribute under consideration. To avoid high computational cost, we approximate the solution by the expected minimum conditional entropy with respect to random projections. This approach is tested on three artificial data sets, three cheminformatics data sets, and two leukemia gene expression data sets. Empirical results demonstrate that our method is capable of selecting a proper discrete or categorical attribute to simplify the problem, i.e., the performance of the classifier built for the restructured problem always beats that of the original problem.

conclusionsThe proposed conditional entropy based metric is effective in identifying good partitions of a classification problem, hence enhancing the prediction performance.

Indexed as

Artificial IntelligenceModels, BiologicalAlgorithmsEntropyGlycogen Synthase Kinase 3Glycogen Synthase Kinase 3 betaHumansPrecursor Cell Lymphoblastic Leukemia-LymphomaPrognosisReceptor, Cannabinoid, CB1Receptor, Cannabinoid, CB2Glycogen Synthase Kinase 3Glycogen Synthase Kinase 3 betaReceptor, Cannabinoid, CB1Receptor, Cannabinoid, CB2

Identifiers

PMID22166097
PMCPMC3236845

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.