.png){kind=icon}
Return
A novel forward gene selection algorithm for microarray data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2013.12.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates the gene selection problem for microarray data with small samples and variant correlation. Most existing algorithms usually require expensive computational effort, especially under thousands of gene conditions. The main objective of this paper is to effectively select the most informative genes from microarray data, while making the computational expenses affordable. This is achieved by proposing a novel forward gene selection algorithm (FGSA). To overcome the small samples' problem, the augmented data technique is firstly employed to produce an augmented data set. Taking inspiration from other gene selection methods, the L-2-norm penalty is then introduced into the recently proposed fast regression algorithm to achieve the group selection ability. Finally, by defining a proper regression context, the proposed method can be fast implemented in the software, which significantly reduces computational burden. Both computational complexity analysis and simulation results confirm the effectiveness of the proposed algorithm in comparison with other approaches. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Computational complexity analysis
Data augmentation
Fast regression algorithm
Gene selection
Small samples
Variant correlation
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
ShareSaveProductivity enhancement of solar still by PCM and Nanoparticles miscellaneous basin absorbing materials.png)
Desalination
OAAI
DesalinationIF0
OAAIShareSave
ShareSaveShareSaveShareSaveShareSave
View more