基于最大近邻粗糙逼近的改进特征选择算法

Lin Lv, Yongqing Wei, Min Ren, Jing Yi
{"title":"基于最大近邻粗糙逼近的改进特征选择算法","authors":"Lin Lv, Yongqing Wei, Min Ren, Jing Yi","doi":"10.1109/ITME.2016.0135","DOIUrl":null,"url":null,"abstract":"The feature selection algorithm based on maximal nearest neighbor rough approximation can not only deal with the mixed data, but also avoid the choice of the parameter values in the feature selection algorithm based on neighborhood rough sets. And it reduces the judgement of the sample. But the evaluation standard of this method only considers the importance of a single attribute which is relative to the result of the decision while calculating the importance of the attribute. It ignores the influence of the interaction between the attributes on the result of decision. So this paper sets up the new evaluation standard which is considered the influence of the attributes, and a forward greedy feature selection algorithm is constructed. Experiments show that the proposed algorithm can not only select fewer features, but also improve the accuracy of the classification.","PeriodicalId":184905,"journal":{"name":"2016 8th International Conference on Information Technology in Medicine and Education (ITME)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Improved Feature Selection Algorithm Based on Maximal Nearest-Neighbor Rough Approximation\",\"authors\":\"Lin Lv, Yongqing Wei, Min Ren, Jing Yi\",\"doi\":\"10.1109/ITME.2016.0135\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The feature selection algorithm based on maximal nearest neighbor rough approximation can not only deal with the mixed data, but also avoid the choice of the parameter values in the feature selection algorithm based on neighborhood rough sets. And it reduces the judgement of the sample. But the evaluation standard of this method only considers the importance of a single attribute which is relative to the result of the decision while calculating the importance of the attribute. It ignores the influence of the interaction between the attributes on the result of decision. So this paper sets up the new evaluation standard which is considered the influence of the attributes, and a forward greedy feature selection algorithm is constructed. Experiments show that the proposed algorithm can not only select fewer features, but also improve the accuracy of the classification.\",\"PeriodicalId\":184905,\"journal\":{\"name\":\"2016 8th International Conference on Information Technology in Medicine and Education (ITME)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 8th International Conference on Information Technology in Medicine and Education (ITME)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITME.2016.0135\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th International Conference on Information Technology in Medicine and Education (ITME)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITME.2016.0135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

基于最大近邻粗糙逼近的特征选择算法不仅可以处理混合数据,而且避免了基于邻域粗糙集的特征选择算法中参数值的选择问题。它减少了对样本的判断。但该方法的评价标准在计算属性重要度时,只考虑单个属性相对于决策结果的重要度。它忽略了属性之间的相互作用对决策结果的影响。为此,本文建立了考虑属性影响的新的评价标准,并构造了前向贪婪特征选择算法。实验表明,该算法不仅可以选择更少的特征,而且可以提高分类的准确率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improved Feature Selection Algorithm Based on Maximal Nearest-Neighbor Rough Approximation
The feature selection algorithm based on maximal nearest neighbor rough approximation can not only deal with the mixed data, but also avoid the choice of the parameter values in the feature selection algorithm based on neighborhood rough sets. And it reduces the judgement of the sample. But the evaluation standard of this method only considers the importance of a single attribute which is relative to the result of the decision while calculating the importance of the attribute. It ignores the influence of the interaction between the attributes on the result of decision. So this paper sets up the new evaluation standard which is considered the influence of the attributes, and a forward greedy feature selection algorithm is constructed. Experiments show that the proposed algorithm can not only select fewer features, but also improve the accuracy of the classification.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信