An efficient gene selection algorithm based on tolerance rough set theory

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Gene selection, a key procedure of the discriminant analysis of microarray data, is to select the most informative genes from the whole gene set. Rough set theory is a mathematical tool for further reducing redundancy. One limitation of rough set theory is the lack of effective methods for processing real-valued data. However, most of gene expression data sets are continuous. Discretization methods can result in information loss. This paper investigates an approach combining feature ranking together with feature selection based on tolerance rough set theory. Compared with gene selection algorithm based on rough set theory, the proposed method is more effective for selecting high discriminative genes in cancer classification task. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Jiao, N., & Miao, D. (2009). An efficient gene selection algorithm based on tolerance rough set theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5908 LNAI, pp. 176–183). https://doi.org/10.1007/978-3-642-10646-0_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free