Informative gene set selection via distance sensitive rival penalized competitive learning and redundancy analysis

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

Abstract

This paper presents an informative gene set selection approach to tumor diagnosis based on the Distance Sensitive Rival Penalized Competitive Learning (DSRPCL) algorithm and redundancy analysis. Since the DSRPCL algorithm can allocate an appropriate number of clusters for an input dataset automatically, we can utilize it to classify the genes (expressed by the gene expression levels of all the samples) into certain basic clusters. Then, we apply the post-filtering algorithm to each basic gene cluster to get the typical and independent informative genes. In this way we can obtain a compact set of informative genes. To test the effectiveness of the selected informative gene set, we utilize the support vector machine (SVM) to construct a tumor diagnosis system based on the express profiles of its genes. It is shown by the experiments that the proposed method can achieve a higher diagnosis accuracy with a smaller number of informative genes and less computational complexity in comparison with the previous ones. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Wang, L., & Ma, J. (2007). Informative gene set selection via distance sensitive rival penalized competitive learning and redundancy analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4491 LNCS, pp. 1227–1236). Springer Verlag. https://doi.org/10.1007/978-3-540-72383-7_143

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