DocumentCode :
2861505
Title :
Identifying Genes with The Concept of Customization
Author :
Hua, Dong ; Chen, Dechang ; Youssef, Abdou
Author_Institution :
George Washington University
fYear :
2005
fDate :
25-25 June 2005
Firstpage :
144
Lastpage :
144
Abstract :
Gene selection with microarray data is an important task towards the study of genomics. The goal is to identify the optimal subset of genes such that maximum discrimination power across samples (e.g., tumor types) while minimum redundancy among genes are achieved. Essentially, it is NPcomplete. Approximation algorithms are usually solicited including individual ranking and sequential forward selection. Typically, from source input microarray data to output selected genes, multiple steps including preprocessing, discretization, discrimination modeling, redundancy modeling, optimization formularization, classification, and evaluation are involved in the presence of a number of options (techniques) for each of them. Putting them together, we form the concept of customization for gene selection in this paper, that is, configure the entire scenario such that various maybe trivial techniques can team work with superior performance rather than focus on certain technique within a single step (e.g., discrimination power modeling). One configuration following the principle of simplicity is constructed in this paper which identi?es genes effectively shown by experiments.
Keywords :
Approximation algorithms; Bioinformatics; Biological system modeling; Cancer; Data mining; Data preprocessing; Genetics; Genomics; Neoplasms; Redundancy;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision and Pattern Recognition - Workshops, 2005. CVPR Workshops. IEEE Computer Society Conference on
Conference_Location :
San Diego, CA, USA
ISSN :
1063-6919
Print_ISBN :
0-7695-2372-2
Type :
conf
DOI :
10.1109/CVPR.2005.472
Filename :
1565462
Link To Document :
بازگشت