Evidence map›Paper›PMID 27059502›Full record

ArticleBMC bioinformatics2016

Structured feature selection using coordinate descent optimization.

Mohamed F Ghalwash, Xi Hang Cao, Ivan Stojkovic, Zoran Obradovic

Abstract read
In one paragraph

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

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

7 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. 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.

Mohamed F GhalwashCenter for Data Analytics and Biomedical Informatics, College of Science and Technology, Temple University, North 12th Street, Philadelphia, 19122, PA, USA. mohamed.ghalwash@temple.edu.
Xi Hang CaoCenter for Data Analytics and Biomedical Informatics, College of Science and Technology, Temple University, North 12th Street, Philadelphia, 19122, PA, USA.
Ivan StojkovicCenter for Data Analytics and Biomedical Informatics, College of Science and Technology, Temple University, North 12th Street, Philadelphia, 19122, PA, USA.
Zoran ObradovicCenter for Data Analytics and Biomedical Informatics, College of Science and Technology, Temple University, North 12th Street, Philadelphia, 19122, PA, USA.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundExisting feature selection methods typically do not consider prior knowledge in the form of structural relationships among features. In this study, the features are structured based on prior knowledge into groups. The problem addressed in this article is how to select one representative feature from each group such that the selected features are jointly discriminating the classes. The problem is formulated as a binary constrained optimization and the combinatorial optimization is relaxed as a convex-concave problem, which is then transformed into a sequence of convex optimization problems so that the problem can be solved by any standard optimization algorithm. Moreover, a block coordinate gradient descent optimization algorithm is proposed for high dimensional feature selection, which in our experiments was four times faster than using a standard optimization algorithm.

resultsIn order to test the effectiveness of the proposed formulation, we used microarray analysis as a case study, where genes with similar expressions or similar molecular functions were grouped together. In particular, the proposed block coordinate gradient descent feature selection method is evaluated on five benchmark microarray gene expression datasets and evidence is provided that the proposed method gives more accurate results than the state-of-the-art gene selection methods. Out of 25 experiments, the proposed method achieved the highest average AUC in 13 experiments while the other methods achieved higher average AUC in no more than 6 experiments.

conclusionA method is developed to select a feature from each group. When the features are grouped based on similarity in gene expression, we showed that the proposed algorithm is more accurate than state-of-the-art gene selection methods that are particularly developed to select highly discriminative and less redundant genes. In addition, the proposed method can exploit any grouping structure among features, while alternative methods are restricted to using similarity based grouping.

Indexed as

AlgorithmsModels, TheoreticalCorneal NeovascularizationDatabases, GeneticGene Expression RegulationGene OntologyGenetic VariationHemoglobinuriaHIV InfectionsHumansMelanomaMicroarray AnalysisMultiple MyelomaNeuroendocrine TumorsNevusStress, PhysiologicalBlock coordinate gradient descentGene expressionMicroarray analysisPrior knowledgeStructured feature selection

Identifiers

PMID27059502
PMCPMC4826549

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.