Informative Gene Set Selection Via Distance Sensitive Rival Penalized Competitive Learning and Redundancy Analysis

  • Authors:
  • Liangliang Wang;Jinwen Ma

  • Affiliations:
  • Department of Information Science, School of Mathematical Sciences, and LMAM, Peking University, Beijing, 100871, China;Department of Information Science, School of Mathematical Sciences, and LMAM, Peking University, Beijing, 100871, China

  • Venue:
  • ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.