{"title":"基于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":"{\"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}","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}
Acceleration of Feature Subset Selection Using CUDA
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.