Feature Selection in Microarray Gene Expression Data Using Fisher Discriminant Ratio

Saeed Sarbazi-Azad, M. S. Abadeh, Mehdi Irannejad Najaf Abadi
{"title":"Feature Selection in Microarray Gene Expression Data Using Fisher Discriminant Ratio","authors":"Saeed Sarbazi-Azad, M. S. Abadeh, Mehdi Irannejad Najaf Abadi","doi":"10.1109/ICCKE.2018.8566649","DOIUrl":null,"url":null,"abstract":"One of major issues in microarray gene expression datasets is high dimensionality. Redundant features and low number of samples hinder the process of learning a model and the created model results in low performance. To create a model with high performance and low error rate, it is staple to reduce the number of features. In the last two decades, the data complexity measures were employed for different usages in machine learning such as feature selection. In proposed method of this paper, first the features of dataset are ranked by one of data complexity measures named fisher discriminant ratio and afterwards the highest ranked features are selected from the feature set. Experiments are performed on 5 well-known binary microarray datasets to assess the performance of the proposed method. For classification, support vector machine, decision tree, naive bayes and k-nearest neighbor algorithms were applied to the resulting discussed features. The results demonstrate transcendent performance in terms of low computational time and higher accuracy on tested data.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"341 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE.2018.8566649","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

One of major issues in microarray gene expression datasets is high dimensionality. Redundant features and low number of samples hinder the process of learning a model and the created model results in low performance. To create a model with high performance and low error rate, it is staple to reduce the number of features. In the last two decades, the data complexity measures were employed for different usages in machine learning such as feature selection. In proposed method of this paper, first the features of dataset are ranked by one of data complexity measures named fisher discriminant ratio and afterwards the highest ranked features are selected from the feature set. Experiments are performed on 5 well-known binary microarray datasets to assess the performance of the proposed method. For classification, support vector machine, decision tree, naive bayes and k-nearest neighbor algorithms were applied to the resulting discussed features. The results demonstrate transcendent performance in terms of low computational time and higher accuracy on tested data.
基于Fisher判别比的微阵列基因表达数据特征选择
微阵列基因表达数据集的一个主要问题是高维度。冗余的特征和低样本数量阻碍了学习模型的过程,并且创建的模型导致低性能。为了创建一个高性能、低错误率的模型,减少特征的数量是关键。在过去的二十年中,数据复杂性度量在机器学习中被用于不同的用途,如特征选择。在本文提出的方法中,首先使用一种称为fisher判别率的数据复杂度度量对数据集的特征进行排序,然后从特征集中选择排名最高的特征。在5个众所周知的二进制微阵列数据集上进行了实验,以评估所提出方法的性能。对于分类,将支持向量机、决策树、朴素贝叶斯和k近邻算法应用于得到的讨论特征。结果表明,该方法具有较低的计算时间和较高的测试数据精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信