Genetic algorithm and fuzzy C-means for feature selection: Based on a dual fitness function

Elmira Amiri Souri, Azadeh Mohebi, Abbas Ahmadi
{"title":"Genetic algorithm and fuzzy C-means for feature selection: Based on a dual fitness function","authors":"Elmira Amiri Souri, Azadeh Mohebi, Abbas Ahmadi","doi":"10.1109/AISP.2017.8515120","DOIUrl":null,"url":null,"abstract":"Feature selection is known as an effective approach to overcome computational complexity and information redundancy in high-dimensional data classification and clustering. Selecting best features in unsupervised learning is much harder than supervised learning because we do not have the labels of data that can guide selection algorithms to remove irrelevant and redundant features. In this paper, we propose a new approach for unsupervised feature selection based on Genetic Algorithm as a heuristic search approach and combine it with Fuzzy C-Means algorithm. We propose a dual, multi objective fitness function based on Davies-Bouldin (DB) and Calinski-Harabasz (CH) indexes. We show that these indices do not necessarily have similar behaviors. Thus, rather than simply considering their weighted average as a new fitness function, we propose a new approach to aggregate them based on their tradeoffs. Comparison of the proposed approach with popular feature selection algorithms, across different datasets, indicates the outperformance of the proposed approach for feature selection.","PeriodicalId":386952,"journal":{"name":"2017 Artificial Intelligence and Signal Processing Conference (AISP)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Artificial Intelligence and Signal Processing Conference (AISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AISP.2017.8515120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Feature selection is known as an effective approach to overcome computational complexity and information redundancy in high-dimensional data classification and clustering. Selecting best features in unsupervised learning is much harder than supervised learning because we do not have the labels of data that can guide selection algorithms to remove irrelevant and redundant features. In this paper, we propose a new approach for unsupervised feature selection based on Genetic Algorithm as a heuristic search approach and combine it with Fuzzy C-Means algorithm. We propose a dual, multi objective fitness function based on Davies-Bouldin (DB) and Calinski-Harabasz (CH) indexes. We show that these indices do not necessarily have similar behaviors. Thus, rather than simply considering their weighted average as a new fitness function, we propose a new approach to aggregate them based on their tradeoffs. Comparison of the proposed approach with popular feature selection algorithms, across different datasets, indicates the outperformance of the proposed approach for feature selection.
基于对偶适应度函数的遗传算法和模糊c均值特征选择
特征选择是克服高维数据分类和聚类中计算复杂性和信息冗余的有效方法。在无监督学习中选择最佳特征比有监督学习困难得多,因为我们没有数据标签来指导选择算法去除不相关和冗余的特征。本文提出了一种基于遗传算法的启发式特征选择新方法,并将其与模糊c均值算法相结合。本文提出了一种基于Davies-Bouldin (DB)和Calinski-Harabasz (CH)指标的双目标多目标适应度函数。我们表明,这些指数不一定具有相似的行为。因此,我们不是简单地将它们的加权平均值视为新的适应度函数,而是提出了一种基于它们的权衡来聚合它们的新方法。在不同的数据集上,将所提出的方法与流行的特征选择算法进行比较,表明所提出的方法在特征选择方面具有优异的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信