Memetic NSGA -一种用于微阵列数据分类的多目标遗传算法

Praveen Kumar, Sharath S, Rio D 'souza, K. C. Sekaran
{"title":"Memetic NSGA -一种用于微阵列数据分类的多目标遗传算法","authors":"Praveen Kumar, Sharath S, Rio D 'souza, K. C. Sekaran","doi":"10.1109/ADCOM.2007.90","DOIUrl":null,"url":null,"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 of misclassified 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.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Memetic NSGA - a multi-objective genetic algorithm for classification of microarray data\",\"authors\":\"Praveen Kumar, Sharath S, Rio D 'souza, K. C. Sekaran\",\"doi\":\"10.1109/ADCOM.2007.90\",\"DOIUrl\":null,\"url\":null,\"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 of misclassified 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.\",\"PeriodicalId\":185608,\"journal\":{\"name\":\"15th International Conference on Advanced Computing and Communications (ADCOM 2007)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"15th International Conference on Advanced Computing and Communications (ADCOM 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ADCOM.2007.90\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ADCOM.2007.90","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

在基因表达研究中,基因亚群的识别是一项重要的任务,负责将可用样本分类为两个或多个类别。鉴定这些基因亚群的一个主要困难是,与样本中的基因数量相比,只有少数样本可用。在这里,我们将此问题视为最小化基因子集大小和最小化错误分类样本数量的多目标优化问题。利用模因的概念,提出了一种新的基于精英非支配排序的遗传算法(NSGA)。模因是一组在表型水平上具有特定功能的基因。我们选择了一个包含50个基因的白血病数据集来评估我们的算法。将Memetic-NSGA与另一种非支配排序遗传算法NSGA-II进行了比较研究。Memetic-NSGA在执行时间和确定的基因子集长度方面表现更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Memetic NSGA - a multi-objective genetic algorithm for classification of microarray data
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 of misclassified 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信