A Fast Hybrid Feature Selection Method

Mohammad Ahmadi Ganjei, R. Boostani
{"title":"A Fast Hybrid Feature Selection Method","authors":"Mohammad Ahmadi Ganjei, R. Boostani","doi":"10.1109/ICCKE48569.2019.8964884","DOIUrl":null,"url":null,"abstract":"To confront with high dimensional datasets, several feature selection schemes have been suggested in three types of wrapper, filter, and hybrid. Hybrid feature selection methods adopt both filter and wrapper approaches by compromising between the computational complexity and efficiency. In this paper, we proposed a new hybrid feature selection method, in which in the filter stage the features are ranked according to their relevance. Instead of running the wrapper on all the features, we use a split-to-blocks technique and show that block size has a considerable impact on performance. A sequential forward selection (SFS) method was applied to the ranked blocks of features in order to find the most relevant features. The proposed method rapidly eliminates a large number of irrelevant features in its ranking stage, and then different block sizes were evaluated in the wrapper phase by choosing a proper block size using SFS. It causes this method to have a low time complexity, despite the good results. Hybrid methods consist of components that have different criteria for them. we compare and analyze different criteria. To show the effectiveness of the proposed method, state-of-the-art hybrid feature selection methods like re-Ranking, IGIS, and IGIS+ were implemented and their classification accuracies, over the known benchmarks, were computed using the K-nearest neighbor (KNN) and decision tree classifiers. Applying statistical tests to the compared results supports the superiority of the proposed method to the counterparts.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"1 1","pages":"6-11"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE48569.2019.8964884","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

To confront with high dimensional datasets, several feature selection schemes have been suggested in three types of wrapper, filter, and hybrid. Hybrid feature selection methods adopt both filter and wrapper approaches by compromising between the computational complexity and efficiency. In this paper, we proposed a new hybrid feature selection method, in which in the filter stage the features are ranked according to their relevance. Instead of running the wrapper on all the features, we use a split-to-blocks technique and show that block size has a considerable impact on performance. A sequential forward selection (SFS) method was applied to the ranked blocks of features in order to find the most relevant features. The proposed method rapidly eliminates a large number of irrelevant features in its ranking stage, and then different block sizes were evaluated in the wrapper phase by choosing a proper block size using SFS. It causes this method to have a low time complexity, despite the good results. Hybrid methods consist of components that have different criteria for them. we compare and analyze different criteria. To show the effectiveness of the proposed method, state-of-the-art hybrid feature selection methods like re-Ranking, IGIS, and IGIS+ were implemented and their classification accuracies, over the known benchmarks, were computed using the K-nearest neighbor (KNN) and decision tree classifiers. Applying statistical tests to the compared results supports the superiority of the proposed method to the counterparts.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种快速混合特征选择方法
针对高维数据集,提出了三种类型的特征选择方案:包装、过滤和混合。混合特征选择方法在计算复杂度和效率之间折衷,采用滤波和包装两种方法。本文提出了一种新的混合特征选择方法,该方法在滤波阶段根据特征的相关性对特征进行排序。我们没有在所有特性上运行包装器,而是使用分割到块的技术,并表明块大小对性能有相当大的影响。采用顺序前向选择(SFS)方法对特征块进行排序,找出最相关的特征。该方法在排序阶段快速剔除大量不相关特征,然后在包装阶段通过使用SFS选择合适的块大小来评估不同的块大小。这使得该方法具有较低的时间复杂度,尽管效果很好。混合方法由具有不同标准的组件组成。我们比较和分析不同的标准。为了证明所提出方法的有效性,实现了最先进的混合特征选择方法,如re-Ranking、IGIS和IGIS+,并使用k -最近邻(KNN)和决策树分类器计算了它们在已知基准上的分类精度。对比较结果进行统计检验,证明了所提方法相对于同类方法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Parallel Jobs Scheduling Algorithm in The Cloud Computing Online QoS Multicast Routing in Multi-Channel Multi-Radio Wireless Mesh Networks using Network Coding Tasks Decomposition for Improvement of Genetic Network Programming Robust Real-time Magnetic-based Object Localization to Sensor’s Fault using Recurrent Neural Networks A Case Study for Presenting Bank Recommender Systems based on Bon Card Transaction Data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1