基于条件互信息的分类问题改进特征选择算法

Jaganathan Palanichamy, Kuppuchamy Ramasamy
{"title":"基于条件互信息的分类问题改进特征选择算法","authors":"Jaganathan Palanichamy, Kuppuchamy Ramasamy","doi":"10.1109/ICHCI-IEEE.2013.6887802","DOIUrl":null,"url":null,"abstract":"The purpose of the feature selection is to eliminate insignificant features from entire dataset and simultaneously to keep the class discriminatory information for classification problems. Many feature selection algorithms have been proposed to measure the relevance and redundancy of the features and class variables. In this paper, we proposed an improved feature selection algorithm based on maximum relevance and minimum redundancy criterion. The relevance of a feature to the class variables are evaluated with mutual information and conditional mutual information is used to calculate the redundancy between the selected and the candidate features to each class variable. The experimental result is tested with five benchmarked datasets available from UCI Machine Learning Repository. The results shows the proposed algorithm is considered quite well when compared with some existing algorithms.","PeriodicalId":419263,"journal":{"name":"2013 International Conference on Human Computer Interactions (ICHCI)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An improved feature selection algorithm with conditional mutual information for classification problems\",\"authors\":\"Jaganathan Palanichamy, Kuppuchamy Ramasamy\",\"doi\":\"10.1109/ICHCI-IEEE.2013.6887802\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The purpose of the feature selection is to eliminate insignificant features from entire dataset and simultaneously to keep the class discriminatory information for classification problems. Many feature selection algorithms have been proposed to measure the relevance and redundancy of the features and class variables. In this paper, we proposed an improved feature selection algorithm based on maximum relevance and minimum redundancy criterion. The relevance of a feature to the class variables are evaluated with mutual information and conditional mutual information is used to calculate the redundancy between the selected and the candidate features to each class variable. The experimental result is tested with five benchmarked datasets available from UCI Machine Learning Repository. The results shows the proposed algorithm is considered quite well when compared with some existing algorithms.\",\"PeriodicalId\":419263,\"journal\":{\"name\":\"2013 International Conference on Human Computer Interactions (ICHCI)\",\"volume\":\"146 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Human Computer Interactions (ICHCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICHCI-IEEE.2013.6887802\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Human Computer Interactions (ICHCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICHCI-IEEE.2013.6887802","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

特征选择的目的是从整个数据集中剔除不重要的特征,同时保留分类问题的类区别信息。人们提出了许多特征选择算法来衡量特征和类变量的相关性和冗余性。本文提出了一种基于最大相关度和最小冗余度准则的改进特征选择算法。利用互信息评价特征与类变量的相关性,并利用条件互信息计算所选特征与候选特征对每个类变量的冗余度。实验结果用UCI机器学习存储库中的五个基准数据集进行了测试。结果表明,与现有算法相比,本文提出的算法得到了较好的考虑。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An improved feature selection algorithm with conditional mutual information for classification problems
The purpose of the feature selection is to eliminate insignificant features from entire dataset and simultaneously to keep the class discriminatory information for classification problems. Many feature selection algorithms have been proposed to measure the relevance and redundancy of the features and class variables. In this paper, we proposed an improved feature selection algorithm based on maximum relevance and minimum redundancy criterion. The relevance of a feature to the class variables are evaluated with mutual information and conditional mutual information is used to calculate the redundancy between the selected and the candidate features to each class variable. The experimental result is tested with five benchmarked datasets available from UCI Machine Learning Repository. The results shows the proposed algorithm is considered quite well when compared with some existing algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An efficient technique for video content managing in peer-to-peer computing using multilevel cache and bandwidth based cluster A feasibility study for developing an emotional control system through brain computer interface Various levels of human stress & their impact on human computer interaction Partial-retuning of decentralised PI controller of nonlinear multivariable process using firefly algorithm Automation framework for localizability testing of internationalized software
×
引用
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