期刊
NEUROCOMPUTING
卷 133, 期 -, 页码 446-458出版社
ELSEVIER
DOI: 10.1016/j.neucom.2013.12.012
关键词
Computational complexity analysis; Data augmentation; Fast regression algorithm; Gene selection; Small samples; Variant correlation
资金
- National Science Foundation of China [51007052, 61104089]
- National Key Scientific Instrument and Equipment Development Project [2012YQ15008703]
- Science and Technology Commission of Shanghai Municipality [11ZR1413100, 11jc1404000]
- Shanghai Rising-Star Program [13QA1401600]
- cultivating foundation for the youth teacher of Shanghai colleges
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据