Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/8590
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kumar, K, P. | - |
dc.contributor.author | Sharath, S. | - |
dc.contributor.author | D'Souza, G, R. | - |
dc.contributor.author | Sekaran, K.C. | - |
dc.date.accessioned | 2020-03-30T10:22:27Z | - |
dc.date.available | 2020-03-30T10:22:27Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | Proceedings of the 15th International Conference on Advanced Computing and Communications, ADCOM 2007, 2007, Vol., , pp.75-80 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/8590 | - |
dc.description.abstract | In Gene Expression studies, the identification of gene subsets responsible for classifying available samples to two or more classes is an important task. One major difficulty in identifying these gene subsets is the availability of only a few samples compared to the number of genes in the samples. Here we treat this problem as a Multi-objective optimization problem of minimizing the gene subset size and minimizing the number ofmisclassified samples. We present a new elitist Non-dominated Sorting-based Genetic Algorithm (NSGA) called Memetic-NSGA which uses the concept of Memes. Memes are a group of genes which have a particular functionality at the phenotype level. We have chosen a 50 gene Leukemia dataset to evaluate our algorithm. A comparative study between Memetic-NSGA and another Non-dominated Sorting Genetic Algorithm, called NSGA-II, is presented. Memetic-NSGA is found to perform better in terms of execution time and gene-subset length identified. � 2007 IEEE. | en_US |
dc.title | Memetic NSGA - A multi-objective genetic algorithm for classification of microarray data | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.