利用犹豫模糊集的信息能量和相关系数选择特征子集

M. K. Ebrahimpour, M. Eftekhari
{"title":"利用犹豫模糊集的信息能量和相关系数选择特征子集","authors":"M. K. Ebrahimpour, M. Eftekhari","doi":"10.1109/IKT.2015.7288746","DOIUrl":null,"url":null,"abstract":"In this paper, a novel feature selection algorithm based on hesitant fuzzy sets (HFS) is proposed. For each feature two HFSs are defined.For generating the first HFS for each defining feature, the opinions of three different ranking algorithms are considered. For second HFS for each feature the opinions of three different proximity measures are considered. The Information Energy (IE) of the first HFS for each feature is considered as the relevancy measure of the feature to the class labels. Then the hesitant correlation coefficient matrix for features is calculated based on the second HFSs. After that the average of hesitant correlation coefficients is considered as the relevancy measure of selected features. By combining hesitant based relevancy and redundancy measures, a new feature selection merit is proposed. The proposed merit potentially is able to consider both the maximum relevancy and the minimum redundancy of selected features. The efficiency of this approach is proved through 9 UCI repository datasets. The approach demonstrates a significant performance in both number of selected features and classification accuracy by four different classifiers.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Feature subset selection using Information Energy and correlation coefficients of hesitant fuzzy sets\",\"authors\":\"M. K. Ebrahimpour, M. Eftekhari\",\"doi\":\"10.1109/IKT.2015.7288746\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a novel feature selection algorithm based on hesitant fuzzy sets (HFS) is proposed. For each feature two HFSs are defined.For generating the first HFS for each defining feature, the opinions of three different ranking algorithms are considered. For second HFS for each feature the opinions of three different proximity measures are considered. The Information Energy (IE) of the first HFS for each feature is considered as the relevancy measure of the feature to the class labels. Then the hesitant correlation coefficient matrix for features is calculated based on the second HFSs. After that the average of hesitant correlation coefficients is considered as the relevancy measure of selected features. By combining hesitant based relevancy and redundancy measures, a new feature selection merit is proposed. The proposed merit potentially is able to consider both the maximum relevancy and the minimum redundancy of selected features. The efficiency of this approach is proved through 9 UCI repository datasets. The approach demonstrates a significant performance in both number of selected features and classification accuracy by four different classifiers.\",\"PeriodicalId\":338953,\"journal\":{\"name\":\"2015 7th Conference on Information and Knowledge Technology (IKT)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 7th Conference on Information and Knowledge Technology (IKT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IKT.2015.7288746\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 7th Conference on Information and Knowledge Technology (IKT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IKT.2015.7288746","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

提出了一种基于犹豫模糊集(HFS)的特征选择算法。对于每个特征定义两个hfs。为了为每个定义特征生成第一个HFS,考虑了三种不同排序算法的意见。对于每个特征的第二个HFS,考虑了三个不同接近度量的意见。每个特征的第一个HFS的信息能量(IE)被认为是特征与类标签的相关性度量。然后基于第二hfs计算特征的犹豫相关系数矩阵。然后将犹豫相关系数的平均值作为所选特征的相关性度量。将基于犹豫的相关性和冗余度量相结合,提出了一种新的特征选择方法。所提出的优点可能是能够考虑所选特征的最大相关性和最小冗余。通过9个UCI存储库数据集验证了该方法的有效性。通过四种不同的分类器,该方法在选择特征的数量和分类精度方面都表现出了显著的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Feature subset selection using Information Energy and correlation coefficients of hesitant fuzzy sets
In this paper, a novel feature selection algorithm based on hesitant fuzzy sets (HFS) is proposed. For each feature two HFSs are defined.For generating the first HFS for each defining feature, the opinions of three different ranking algorithms are considered. For second HFS for each feature the opinions of three different proximity measures are considered. The Information Energy (IE) of the first HFS for each feature is considered as the relevancy measure of the feature to the class labels. Then the hesitant correlation coefficient matrix for features is calculated based on the second HFSs. After that the average of hesitant correlation coefficients is considered as the relevancy measure of selected features. By combining hesitant based relevancy and redundancy measures, a new feature selection merit is proposed. The proposed merit potentially is able to consider both the maximum relevancy and the minimum redundancy of selected features. The efficiency of this approach is proved through 9 UCI repository datasets. The approach demonstrates a significant performance in both number of selected features and classification accuracy by four different classifiers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信