Skip Navigation


Mathematical Medicine and Biology Advance Access originally published online on February 22, 2008
Mathematical Medicine and Biology 2007 24(4):413-426; doi:10.1093/imammb/dqn001
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
24/4/413-a    most recent
dqn001v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Robbins, K. R.
Right arrow Articles by Rekaya, R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Robbins, K. R.
Right arrow Articles by Rekaya, R.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The author 2008. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

The ant colony algorithm for feature selection in high-dimension gene expression data for disease classification

K. R. Robbins{dagger}, W. Zhang and J. K. Bertrand

Department of Animal and Dairy Science, The University of Georgia, Athens, GA 30602, USA

R. Rekaya

Department of Animal and Dairy Science, Department of Statistics, and Institute of Bioinformatics, The University of Georgia, Athens, GA 30602, USA

{dagger} Email: krobbin1{at}uga.edu

Received on February 23, 2007. Revised on January 16, 2008. Accepted on January 17, 2008.

The use of gene expression data to diagnose complex diseases represents an exciting area of medicine; however, such data sets are often noisy, requiring the selection of feature subsets to obtain maximum classification accuracy. Due to the high dimensions of many expression data sets, filter-based methods are commonly used, but often yield inconsistent results. Optimization algorithms can outperform filter methods, but often require preselection of features to achieve good results. To address the problems of many commonly used feature selection methods, the ant colony algorithm (ACA) is proposed for use on data sets with large numbers of features. The ACA is an optimization algorithm capable of incorporating prior information, allowing it to search the sample space more efficiently than other optimization methods. When applied to several high-dimensional data sets, the ACA was able to identify small subsets of highly predictive and biologically relevant genes without the need for extensive preselection of features. Using the selected genes to train a latent variable model yielded substantial increases in prediction accuracy when compared to several rank-based methods and results obtained in previous studies. The superiority of the ACA algorithm was validated through simulation.

Keywords: ant colony algorithm; disease diagnostics; feature selection; gene expression


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.