基于MapReduce的生物标记物特征选择新方法

Ahlem Kourid, M. Batouche
{"title":"基于MapReduce的生物标记物特征选择新方法","authors":"Ahlem Kourid, M. Batouche","doi":"10.1109/ICCVIA.2015.7351888","DOIUrl":null,"url":null,"abstract":"Scale feature selection is one of the most important fields in the big data domain that can solve real data problems, such as bioinformatics, when it is necessary to process huge amount of data. The efficiency of existing feature selection algorithms significantly downgrades, if not totally inapplicable, when data size exceeds hundreds of gigabytes, because most feature selection algorithms are designed for centralized computing architecture. For that distributed computing techniques, such as MapReduce can be applied to handle very large data. Our approach is to scale the existing method for feature selection, Kmeans clustering and Signal to Noise Ratio (SNR) combined with optimization technique as Binary Particle Swarm Optimization (BPSO). The proposed method is divided into two stages. In the first stage, we have used parallel Kmeans on MapReduce for clustering features, and then we have applied iterative MapReduce that implement parallel SNR ranking for each cluster, after we have selected the top ranked feature from each cluster. The top scored features from each cluster are gathered and a new feature subset is generated. In the second stage the new feature subset is used as input to the novel BPSO proposed based on MapReduce and optimized feature subset is being produced. The proposed method is implemented in a distributed environment, and its efficiency is illustrated through analyzing practical problems such as biomarker discovery.","PeriodicalId":419122,"journal":{"name":"International Conference on Computer Vision and Image Analysis Applications","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel approach for feature selection based on MapReduce for biomarker discovery\",\"authors\":\"Ahlem Kourid, M. Batouche\",\"doi\":\"10.1109/ICCVIA.2015.7351888\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scale feature selection is one of the most important fields in the big data domain that can solve real data problems, such as bioinformatics, when it is necessary to process huge amount of data. The efficiency of existing feature selection algorithms significantly downgrades, if not totally inapplicable, when data size exceeds hundreds of gigabytes, because most feature selection algorithms are designed for centralized computing architecture. For that distributed computing techniques, such as MapReduce can be applied to handle very large data. Our approach is to scale the existing method for feature selection, Kmeans clustering and Signal to Noise Ratio (SNR) combined with optimization technique as Binary Particle Swarm Optimization (BPSO). The proposed method is divided into two stages. In the first stage, we have used parallel Kmeans on MapReduce for clustering features, and then we have applied iterative MapReduce that implement parallel SNR ranking for each cluster, after we have selected the top ranked feature from each cluster. The top scored features from each cluster are gathered and a new feature subset is generated. In the second stage the new feature subset is used as input to the novel BPSO proposed based on MapReduce and optimized feature subset is being produced. The proposed method is implemented in a distributed environment, and its efficiency is illustrated through analyzing practical problems such as biomarker discovery.\",\"PeriodicalId\":419122,\"journal\":{\"name\":\"International Conference on Computer Vision and Image Analysis Applications\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Computer Vision and Image Analysis Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCVIA.2015.7351888\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computer Vision and Image Analysis Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCVIA.2015.7351888","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

尺度特征选择是大数据领域中最重要的领域之一,它可以解决生物信息学等需要处理大量数据的实际数据问题。当数据大小超过数百gb时,现有的特征选择算法的效率会显著降低,如果不是完全不适用,因为大多数特征选择算法都是为集中计算架构设计的。因此,分布式计算技术,如MapReduce可以应用于处理非常大的数据。我们的方法是扩展现有的特征选择、Kmeans聚类和信噪比(SNR)方法,并结合优化技术作为二元粒子群优化(BPSO)。该方法分为两个阶段。在第一阶段,我们在MapReduce上使用并行Kmeans对特征进行聚类,然后在我们从每个聚类中选择排名最高的特征后,我们应用迭代MapReduce对每个聚类实现并行信噪比排序。从每个聚类中收集得分最高的特征并生成一个新的特征子集。在第二阶段,将新的特征子集作为基于MapReduce提出的新的BPSO的输入,并生成优化的特征子集。在分布式环境中实现了该方法,并通过对生物标记物发现等实际问题的分析说明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel approach for feature selection based on MapReduce for biomarker discovery
Scale feature selection is one of the most important fields in the big data domain that can solve real data problems, such as bioinformatics, when it is necessary to process huge amount of data. The efficiency of existing feature selection algorithms significantly downgrades, if not totally inapplicable, when data size exceeds hundreds of gigabytes, because most feature selection algorithms are designed for centralized computing architecture. For that distributed computing techniques, such as MapReduce can be applied to handle very large data. Our approach is to scale the existing method for feature selection, Kmeans clustering and Signal to Noise Ratio (SNR) combined with optimization technique as Binary Particle Swarm Optimization (BPSO). The proposed method is divided into two stages. In the first stage, we have used parallel Kmeans on MapReduce for clustering features, and then we have applied iterative MapReduce that implement parallel SNR ranking for each cluster, after we have selected the top ranked feature from each cluster. The top scored features from each cluster are gathered and a new feature subset is generated. In the second stage the new feature subset is used as input to the novel BPSO proposed based on MapReduce and optimized feature subset is being produced. The proposed method is implemented in a distributed environment, and its efficiency is illustrated through analyzing practical problems such as biomarker discovery.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信