Multi-Objective Feature Selection based on Clustering and Principal Component Analysis by Enhanced Electromagnetic-likes Algorithm

Majid Abdolrazzagh, Shokooh Pour Mahyabadi, Somaye Jalali-Poor, Erna Budhiarti Nababan
{"title":"Multi-Objective Feature Selection based on Clustering and Principal Component Analysis by Enhanced Electromagnetic-likes Algorithm","authors":"Majid Abdolrazzagh, Shokooh Pour Mahyabadi, Somaye Jalali-Poor, Erna Budhiarti Nababan","doi":"10.1109/DATABIA50434.2020.9190226","DOIUrl":null,"url":null,"abstract":"Given the rapid growth of data and the reduced implementation quality of data mining and pattern extraction techniques, the use of feature reduction has become an important challenge of data mining and pattern recognition. An important goal of data reduction techniques is to make the minimum effort and achieve the maximum efficiency of data selection for the implementation of data mining process. The two primary objectives of feature selection are to minimize the errors of the patterns identified in the reduced subset and minimize the number of features. The majority of available feature selection algorithms adopts a single-objective approach. This is the first paper focused on clustering used as the identifier of unsupervised hidden patterns. It is also focused on the principal component analysis (PCA) to analyze the values of the features. The goals of the new multi-objective feature selection problem are to minimize the coefficient of PCA, maximize the accuracy of k-medoids clustering, and minimize the number of selected features. Another innovation of this study was to select the best subset of features at the best performance by using the electromagnetism-like mechanism (EM) algorithm. The proposed method was tested on 14 standard UCI datasets. The results indicated the competitive advantage of this algorithm over other algorithms implemented to solve this problem.","PeriodicalId":165106,"journal":{"name":"2020 International Conference on Data Science, Artificial Intelligence, and Business Analytics (DATABIA)","volume":"155 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Data Science, Artificial Intelligence, and Business Analytics (DATABIA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DATABIA50434.2020.9190226","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Given the rapid growth of data and the reduced implementation quality of data mining and pattern extraction techniques, the use of feature reduction has become an important challenge of data mining and pattern recognition. An important goal of data reduction techniques is to make the minimum effort and achieve the maximum efficiency of data selection for the implementation of data mining process. The two primary objectives of feature selection are to minimize the errors of the patterns identified in the reduced subset and minimize the number of features. The majority of available feature selection algorithms adopts a single-objective approach. This is the first paper focused on clustering used as the identifier of unsupervised hidden patterns. It is also focused on the principal component analysis (PCA) to analyze the values of the features. The goals of the new multi-objective feature selection problem are to minimize the coefficient of PCA, maximize the accuracy of k-medoids clustering, and minimize the number of selected features. Another innovation of this study was to select the best subset of features at the best performance by using the electromagnetism-like mechanism (EM) algorithm. The proposed method was tested on 14 standard UCI datasets. The results indicated the competitive advantage of this algorithm over other algorithms implemented to solve this problem.
基于聚类和增强类电磁算法主成分分析的多目标特征选择
随着数据量的快速增长以及数据挖掘和模式提取技术实现质量的下降,特征约简的使用已经成为数据挖掘和模式识别的一个重要挑战。数据约简技术的一个重要目标是在数据挖掘过程中以最小的努力实现数据选择的最大效率。特征选择的两个主要目标是最小化在简化子集中识别的模式的错误和最小化特征的数量。现有的特征选择算法大多采用单目标方法。这是第一篇关注聚类作为无监督隐藏模式标识符的论文。并着重于主成分分析(PCA)来分析特征值。新的多目标特征选择问题的目标是最小化主成分分析的系数,最大化k-medoids聚类的准确性,以及最小化选择的特征数量。本研究的另一个创新点是利用类电磁机制(EM)算法选择性能最佳的最佳特征子集。在14个标准UCI数据集上对该方法进行了测试。结果表明,该算法与其他解决该问题的算法相比具有竞争优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信