Acceleration of Feature Subset Selection Using CUDA

Jun Yang, Siyuan Jing
{"title":"Acceleration of Feature Subset Selection Using CUDA","authors":"Jun Yang, Siyuan Jing","doi":"10.1109/CIS2018.2018.00038","DOIUrl":null,"url":null,"abstract":"Rough sets have been proven to be an effective tool for feature subset selection, which is a key step in various machine learning tasks. However, this task is very time consuming. To address this problem, graphics processing unit (GPU), which is a popular device of high performance computing, is applied to accelerate a sorting-based algorithm of feature subset selection. The proposed algorithm is well designed by CUDA programming framework. To obtain great performance gain, two critical steps in rough sets based feature subset selection, which are computation of equivalence class and feature significance, are both executed on GPU. Experimental results show that the proposed algorithm is efficient and it can scale well on large data sets.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS2018.2018.00038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Rough sets have been proven to be an effective tool for feature subset selection, which is a key step in various machine learning tasks. However, this task is very time consuming. To address this problem, graphics processing unit (GPU), which is a popular device of high performance computing, is applied to accelerate a sorting-based algorithm of feature subset selection. The proposed algorithm is well designed by CUDA programming framework. To obtain great performance gain, two critical steps in rough sets based feature subset selection, which are computation of equivalence class and feature significance, are both executed on GPU. Experimental results show that the proposed algorithm is efficient and it can scale well on large data sets.
基于CUDA的特征子集选择加速
粗糙集已被证明是一种有效的特征子集选择工具,这是各种机器学习任务的关键步骤。然而,这项任务非常耗时。为了解决这一问题,采用图形处理单元(GPU)作为一种流行的高性能计算设备来加速基于排序的特征子集选择算法。采用CUDA编程框架对算法进行了较好的设计。为了获得较大的性能增益,在基于粗糙集的特征子集选择中,等效类计算和特征显著性计算两个关键步骤都在GPU上完成。实验结果表明,该算法是有效的,可以很好地扩展到大型数据集上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信