By Topic

Locally optimal search method for identifying genes from microarray data

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
$33 $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

2 Author(s)
Xue-wen Chen ; Dept. of Electr. Eng. & Comput. Sci., Kansas Univ., Lawrence, KS, USA ; Huaixin Chen

The gene expression data obtained from microarrays have shown to be useful in cancer classification. DNA microarray data have extremely high dimensionality compared to the small number of available samples. An important step in microarray studies is to remove genes irrelevant to the learning problem and to select a small number of genes expressed in biological samples under specific conditions. In this paper, we propose a novel feature subset selection algorithm, partitional branch and bound (PBB) algorithm. This new algorithm is very efficient for selecting sets of genes in very high dimensional feature space. Two databases are considered: the colon cancer database and the leukemia database. Our experimental results show that the proposed algorithm yields a better subset of features than both forward selection algorithms and individual ranking methods in terms of a criterion function measuring class separability.

Published in:

Control, Automation, Robotics and Vision Conference, 2004. ICARCV 2004 8th  (Volume:2 )

Date of Conference:

6-9 Dec. 2004