• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A GA-Fuzzy-Based Voting Mechanism for Microarray Data Classification

Chen, Ming-cheng 30 September 2008 (has links)
The microarray technology plays an important role of clinical oncology field. The patient can be diagnosed a symptom about cancer through microarray data. Currently, to solve classification of microarray data is still a wild open issue. Existing methods may have a good performance, but need to spend much time to analyze microarray data, such as SVM. In this thesis, we propose a novel GA-Fuzzy-based voting mechanism to find genes which affect the symptom to better diagnose patient. The proposed algorithm can blur the boundary between classes to handle the ambiguous regions. In order to simulate the gene selection mechanism, we proposed upper bound £\-Cut and lower bound £\-Cut in voting mechanism. Two groups of data collected from the literature are used to test the performance of the proposed algorithm. In the first group of dataset, experimental results show that the accuracies of five datasets using the proposed algorithm are better than those methods proposed by Pochet et al. But, there are the four datasets which the accuracies using the proposed algorithm are a little bit worse than the methods proposed by Pochet et al. For the second group of dataset, the accuracies of seven datasets using the proposed algorithm are better than KerNN proposed by Xiong and Chen. But, there are four datasets which the accuracies using the proposed algorithm are worse than KerNN proposed by Xiong and Chen. Nevertheless, experimental results show that the proposed algorithm performs the best for multi-class data.

Page generated in 0.1458 seconds