The Community for Technology Leaders
Green Image
Issue No. 02 - April-June (2010 vol. 7)
ISSN: 1545-5963
pp: 263-277
Zexuan Zhu , Shenzhen University, Shenzhen
Yew-Soon Ong , Nanyang Technological University, Singapore
Jacek M. Zurada , University of Louisville, Louisville
Multiclass cancer classification on microarray data has provided the feasibility of cancer diagnosis across all of the common malignancies in parallel. Using multiclass cancer feature selection approaches, it is now possible to identify genes relevant to a set of cancer types. However, besides identifying the relevant genes for the set of all cancer types, it is deemed to be more informative to biologists if the relevance of each gene to specific cancer or subset of cancer types could be revealed or pinpointed. In this paper, we introduce two new definitions of multiclass relevancy features, i.e., full class relevant (FCR) and partial class relevant (PCR) features. Particularly, FCR denotes genes that serve as candidate biomarkers for discriminating all cancer types. PCR, on the other hand, are genes that distinguish subsets of cancer types. Subsequently, a Markov blanket embedded memetic algorithm is proposed for the simultaneous identification of both FCR and PCR genes. Results obtained on commonly used synthetic and real-world microarray data sets show that the proposed approach converges to valid FCR and PCR genes that would assist biologists in their research work. The identification of both FCR and PCR genes is found to generate improvement in classification accuracy on many microarray data sets. Further comparison study to existing state-of-the-art feature selection algorithms also reveals the effectiveness and efficiency of the proposed approach.
Bioinformatics, microarray, multiclass cancer classification, feature/gene selection, memetic algorithm, Markov blanket.

J. M. Zurada, Z. Zhu and Y. Ong, "Identification of Full and Partial Class Relevant Genes," in IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. , pp. 263-277, 2008.
84 ms
(Ver 3.3 (11022016))