Gene subset selection using an iterative approach based on genetic algorithms |
| |
Authors: | Mohd Saberi Mohamad Sigeru Omatu Safaai Deris Michifumi Yoshioka |
| |
Affiliation: | 1. Department of Computer Science and Intelligent Systems, Graduate School of Engineering, Osaka Prefecture University, Sakai, Osaka, 599-8531, Japan 2. Department of Software Engineering, Faculty of Computer Science and Information Systems, Universiti Teknologi Malaysia, 81310, Skudai, Johore, Malaysia
|
| |
Abstract: | Microarray data are expected to be useful for cancer classification. However, the process of gene selection for the classification contains a major problem due to properties of the data such as the small number of samples compared with the huge number of genes (higher-dimensional data), irrelevant genes, and noisy data. Hence, this article aims to select a near-optimal (small) subset of informative genes that is most relevant for the cancer classification. To achieve this aim, an iterative approach based on genetic algorithms has been proposed. Experimental results show that the performance of the proposed approach is superior to other previous related work, as well as to four methods tried in this work. In addition, a list of informative genes in the best gene subsets is also presented for biological usage. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|