A New Dimensional Reduction Based on Cuttlefish Algorithm for Human Cancer Gene Expression

Yousif Arshak, A. Eesa
{"title":"A New Dimensional Reduction Based on Cuttlefish Algorithm for Human Cancer Gene Expression","authors":"Yousif Arshak, A. Eesa","doi":"10.1109/ICOASE.2018.8548908","DOIUrl":null,"url":null,"abstract":"Currently, the main problem in DNA Microarray is classification due to the thousands of numbers of genes together, and this huge number of genes can make the classification task very difficult. Therefore, feature selection is a very important task for gene classification. This paper presents a new model which uses a Cuttlefish Algorithm (CFA) to select the most informative features, while K-Nearest Neighbor (KNN) is used to measure the quality of the selected features that are produced by the CFA. Eight datasets are used to evaluate the performance of the proposed model and compared with the performance of four well-known existing classification techniques such as KNN, DT, Hidden Markov models (HMM), and SVM. The obtained results show that the proposed technique outperforms these existing techniques in five datasets among eight datasets.","PeriodicalId":144020,"journal":{"name":"2018 International Conference on Advanced Science and Engineering (ICOASE)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Advanced Science and Engineering (ICOASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOASE.2018.8548908","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Currently, the main problem in DNA Microarray is classification due to the thousands of numbers of genes together, and this huge number of genes can make the classification task very difficult. Therefore, feature selection is a very important task for gene classification. This paper presents a new model which uses a Cuttlefish Algorithm (CFA) to select the most informative features, while K-Nearest Neighbor (KNN) is used to measure the quality of the selected features that are produced by the CFA. Eight datasets are used to evaluate the performance of the proposed model and compared with the performance of four well-known existing classification techniques such as KNN, DT, Hidden Markov models (HMM), and SVM. The obtained results show that the proposed technique outperforms these existing techniques in five datasets among eight datasets.
一种新的基于墨鱼算法的人类癌症基因表达降维方法
目前,DNA微阵列的主要问题是分类,因为成千上万的基因聚集在一起,这种庞大的基因数量使得分类任务非常困难。因此,特征选择是基因分类的一项重要工作。本文提出了一种新的模型,该模型使用墨鱼算法(CFA)来选择信息量最大的特征,并使用k -最近邻(KNN)来衡量CFA生成的所选特征的质量。使用8个数据集来评估所提出模型的性能,并与四种知名的现有分类技术(如KNN、DT、隐马尔可夫模型(HMM)和支持向量机)的性能进行比较。结果表明,该方法在8个数据集中的5个数据集上优于现有方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信