4.5 Article

Tabu Search and Binary Particle Swarm Optimization for Feature Selection Using Microarray Data

期刊

JOURNAL OF COMPUTATIONAL BIOLOGY
卷 16, 期 12, 页码 1689-1703

出版社

MARY ANN LIEBERT, INC
DOI: 10.1089/cmb.2007.0211

关键词

feature selection; K-nearest neighbor; leave-one-out cross-validation; particle swarm optimization; support vector machines; tabu search

资金

  1. National Science Council in Taiwan [NSC94-2622-E151-025-CC3, NSC94-2311-B037-001, NSC93-2213-E-214-037, NSC92-2213-E-214-036]

向作者/读者索取更多资源

Gene expression profiles have great potential as a medical diagnosis tool because they represent the state of a cell at the molecular level. In the classification of cancer type research, available training datasets generally have a fairly small sample size compared to the number of genes involved. This fact poses an unprecedented challenge to some classification methodologies due to training data limitations. Therefore, a good selection method for genes relevant for sample classification is needed to improve the predictive accuracy, and to avoid incomprehensibility due to the large number of genes investigated. In this article, we propose to combine tabu search (TS) and binary particle swarm optimization (BPSO) for feature selection. BPSO acts as a local optimizer each time the TS has been run for a single generation. The K-nearest neighbor method with leave-one-out cross-validation and support vector machine with one-versus-rest serve as evaluators of the TS and BPSO. The proposed method is applied and compared to the 11 classification problems taken from the literature. Experimental results show that our method simplifies features effectively and either obtains higher classification accuracy or uses fewer features compared to other feature selection methods.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据