title: Chaotic genetic algorithm for gene selection and classification problems.
abstract: Pattern recognition techniques suffer from a well-known curse, the dimensionality problem. The microarray data classification problem is a classical complex pattern recognition problem. Selecting relevant genes from microarray data poses a formidable challenge to researchers due to the high-dimensionality of features, multiclass categories being involved, and the usually small sample size. The goal of feature (gene) selection is to select those subsets of differentially expressed genes that are potentially relevant for distinguishing the sample classes. In this paper, information gain and chaotic genetic algorithm are proposed for the selection of relevant genes, and a K-nearest neighbor with the leave-one-out crossvalidation method serves as a classifier. The chaotic genetic algorithm is modified by using the chaotic mutation operator to increase the population diversity. The enhanced population diversity expands the GA's search ability. The proposed approach is tested on 10 microarray data sets from the literature. The experimental results show that the proposed method not only effectively reduced the number of gene expression levels, but also achieved lower classification error rates than other methods.
authors: Institute of Biotechnology and Chemical Engineering, I-Shou University, Kaohsiung, Taiwan, P.R. China.
authors: Li-Yeh
authors: LY
authors: Chuang
authors: Cheng-San
authors: CS
authors: Yang
authors: Jung-Chike
authors: JC
authors: Li
authors: Cheng-Hong
authors: CH
authors: Yang
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods; D030541:Databases, Genetic; D020869:Gene Expression Profiling / Q000379:methods*; D006801:Humans; D009369:Neoplasms / Q000145:classification / Q000235:genetics; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D010363:Pattern Recognition, Automated / Q000379:methods*; D015203:Reproducibility of Results