By Topic

On the Complexity of Gene Marker Selection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Lorena, A.C. ; Centro de Matemtica, Comput. e Cognicao-CMCC, Univ. Fed. do ABC-UFABC, Brazil ; Spolaor, N. ; Costa, I.G. ; Souto, M.C.P.

Gene marker selection from gene expression profiles has been extensively investigated in the Bioinformatics literature. The aim is usually to find a compact set of genes potentially correlated to a particular disease, which can then be candidate targets for new drugs and treatments. Available gene expression data sets are often noisy and sparse, having a low number of patient samples, for which a high number of expressed genes is recorded. These characteristics may pose challenges in finding proper gene markers. Using some available gene expression data sets for cancer diagnosis, we experimentally try to understand the influence of their sparsity in the performance of two popular gene marker selection methods.

Published in:

Neural Networks (SBRN), 2010 Eleventh Brazilian Symposium on

Date of Conference:

23-28 Oct. 2010