一种新的特征选择冗余分析方法

Mei Wang, Xinrong Tao, Fei Han
{"title":"一种新的特征选择冗余分析方法","authors":"Mei Wang, Xinrong Tao, Fei Han","doi":"10.1145/3446132.3446153","DOIUrl":null,"url":null,"abstract":"Feature selection has become an important research issue in the fields of pattern recognition, data mining and machine learning. When processing some high-dimensional data, traditional machine learning algorithms may not be able to get satisfactory results, while feature selection can filter features of high-dimensional data before model training, reduce the number of features, and thus reduce the impact of problems caused by high-dimensional data. Feature selection can simultaneously eliminate features that are less correlated with categories or redundant with selected features, so as to improve classification accuracy and learning and training efficiency of high-dimensional data tasks. However, existing methods may remove redundancy inadequately or excessively in some cases. Therefore, this paper proposes a criterion for the feature redundancy, and based on this criterion, designs an effective feature selection algorithm to remove redundant features on the premise of ensuring maximum relevance to the target variable. The effectiveness and efficiency of the proposed algorithm are verified by experimental comparison with other algorithms that can remove redundant features.","PeriodicalId":125388,"journal":{"name":"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A New Method for Redundancy Analysis in Feature Selection\",\"authors\":\"Mei Wang, Xinrong Tao, Fei Han\",\"doi\":\"10.1145/3446132.3446153\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Feature selection has become an important research issue in the fields of pattern recognition, data mining and machine learning. When processing some high-dimensional data, traditional machine learning algorithms may not be able to get satisfactory results, while feature selection can filter features of high-dimensional data before model training, reduce the number of features, and thus reduce the impact of problems caused by high-dimensional data. Feature selection can simultaneously eliminate features that are less correlated with categories or redundant with selected features, so as to improve classification accuracy and learning and training efficiency of high-dimensional data tasks. However, existing methods may remove redundancy inadequately or excessively in some cases. Therefore, this paper proposes a criterion for the feature redundancy, and based on this criterion, designs an effective feature selection algorithm to remove redundant features on the premise of ensuring maximum relevance to the target variable. The effectiveness and efficiency of the proposed algorithm are verified by experimental comparison with other algorithms that can remove redundant features.\",\"PeriodicalId\":125388,\"journal\":{\"name\":\"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3446132.3446153\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 3rd International Conference on Algorithms, Computing and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3446132.3446153","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

特征选择已成为模式识别、数据挖掘和机器学习等领域的重要研究课题。在处理一些高维数据时,传统的机器学习算法可能无法得到满意的结果,而特征选择可以在模型训练之前过滤高维数据的特征,减少特征的数量,从而减少高维数据带来的问题的影响。特征选择可以同时剔除与类别相关性较小或与所选特征冗余的特征,从而提高分类精度和高维数据任务的学习训练效率。然而,在某些情况下,现有的方法可能会不充分或过度地去除冗余。因此,本文提出了特征冗余准则,并基于该准则设计了一种有效的特征选择算法,在保证与目标变量最大相关性的前提下去除冗余特征。通过与其它去除冗余特征的算法的实验对比,验证了该算法的有效性和高效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Method for Redundancy Analysis in Feature Selection
Feature selection has become an important research issue in the fields of pattern recognition, data mining and machine learning. When processing some high-dimensional data, traditional machine learning algorithms may not be able to get satisfactory results, while feature selection can filter features of high-dimensional data before model training, reduce the number of features, and thus reduce the impact of problems caused by high-dimensional data. Feature selection can simultaneously eliminate features that are less correlated with categories or redundant with selected features, so as to improve classification accuracy and learning and training efficiency of high-dimensional data tasks. However, existing methods may remove redundancy inadequately or excessively in some cases. Therefore, this paper proposes a criterion for the feature redundancy, and based on this criterion, designs an effective feature selection algorithm to remove redundant features on the premise of ensuring maximum relevance to the target variable. The effectiveness and efficiency of the proposed algorithm are verified by experimental comparison with other algorithms that can remove redundant features.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信