特征选择的多模态多目标遗传算法

Jing J. Liang, Junting Yang, C. Yue, Gongping Li, Kunjie Yu, B. Qu
{"title":"特征选择的多模态多目标遗传算法","authors":"Jing J. Liang, Junting Yang, C. Yue, Gongping Li, Kunjie Yu, B. Qu","doi":"10.1109/CEC55065.2022.9870227","DOIUrl":null,"url":null,"abstract":"When performing feature selection on most data sets, there is a general situation that some different feature subsets have the same number of selected features and classification error rate. This indicates that feature selection in some data sets is a multimodal multiobjective optimization (MMO) problem. Most of the current studies on feature selection ignore the MMO problems. Therefore, this paper proposes a feature selection method based on a multimodal multiobjective genetic algorithm (MMOGA) to solve the problem. This algorithm is mainly improved in three aspects. First, a special initialization strategy based on symmetric uncertainty is designed to improve the fitness of the initial population. Second, this paper adds a niche strategy to the genetic algorithm to search for multimodal solutions. Unlike traditional niche methods that has a central individual, this algorithm also considers the distances between individuals in the niche. Third, to effectively utilize excellent individuals for evolution, this algorithm uses a method based on the Pareto set of the niche to generate offspring. Finally, by comparing with other algorithms, the effectiveness of the MMOGA in feature selection is verified. This algorithm can successfully find equivalent feature subsets on different datasets.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Multimodal Multiobjective Genetic Algorithm for Feature Selection\",\"authors\":\"Jing J. Liang, Junting Yang, C. Yue, Gongping Li, Kunjie Yu, B. Qu\",\"doi\":\"10.1109/CEC55065.2022.9870227\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When performing feature selection on most data sets, there is a general situation that some different feature subsets have the same number of selected features and classification error rate. This indicates that feature selection in some data sets is a multimodal multiobjective optimization (MMO) problem. Most of the current studies on feature selection ignore the MMO problems. Therefore, this paper proposes a feature selection method based on a multimodal multiobjective genetic algorithm (MMOGA) to solve the problem. This algorithm is mainly improved in three aspects. First, a special initialization strategy based on symmetric uncertainty is designed to improve the fitness of the initial population. Second, this paper adds a niche strategy to the genetic algorithm to search for multimodal solutions. Unlike traditional niche methods that has a central individual, this algorithm also considers the distances between individuals in the niche. Third, to effectively utilize excellent individuals for evolution, this algorithm uses a method based on the Pareto set of the niche to generate offspring. Finally, by comparing with other algorithms, the effectiveness of the MMOGA in feature selection is verified. This algorithm can successfully find equivalent feature subsets on different datasets.\",\"PeriodicalId\":153241,\"journal\":{\"name\":\"2022 IEEE Congress on Evolutionary Computation (CEC)\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Congress on Evolutionary Computation (CEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC55065.2022.9870227\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC55065.2022.9870227","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在对大多数数据集进行特征选择时,通常存在一些不同的特征子集具有相同的选择特征数量和分类错误率的情况。这表明某些数据集的特征选择是一个多模态多目标优化(MMO)问题。目前大多数关于特征选择的研究都忽略了MMO问题。为此,本文提出了一种基于多模态多目标遗传算法(MMOGA)的特征选择方法来解决这一问题。该算法主要从三个方面进行改进。首先,设计了一种基于对称不确定性的特殊初始化策略,以提高初始种群的适应度。其次,在遗传算法中加入小生境策略来搜索多模态解。与传统的有中心个体的生态位方法不同,该算法还考虑了生态位中个体之间的距离。第三,为了有效地利用优秀个体进行进化,该算法采用基于生态位帕累托集的方法产生子代。最后,通过与其他算法的比较,验证了MMOGA在特征选择方面的有效性。该算法可以在不同的数据集上成功地找到等价的特征子集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Multimodal Multiobjective Genetic Algorithm for Feature Selection
When performing feature selection on most data sets, there is a general situation that some different feature subsets have the same number of selected features and classification error rate. This indicates that feature selection in some data sets is a multimodal multiobjective optimization (MMO) problem. Most of the current studies on feature selection ignore the MMO problems. Therefore, this paper proposes a feature selection method based on a multimodal multiobjective genetic algorithm (MMOGA) to solve the problem. This algorithm is mainly improved in three aspects. First, a special initialization strategy based on symmetric uncertainty is designed to improve the fitness of the initial population. Second, this paper adds a niche strategy to the genetic algorithm to search for multimodal solutions. Unlike traditional niche methods that has a central individual, this algorithm also considers the distances between individuals in the niche. Third, to effectively utilize excellent individuals for evolution, this algorithm uses a method based on the Pareto set of the niche to generate offspring. Finally, by comparing with other algorithms, the effectiveness of the MMOGA in feature selection is verified. This algorithm can successfully find equivalent feature subsets on different datasets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impacts of Single-objective Landscapes on Multi-objective Optimization Cooperative Multi-objective Topology Optimization Using Clustering and Metamodeling Global and Local Area Coverage Path Planner for a Reconfigurable Robot A New Integer Linear Program and A Grouping Genetic Algorithm with Controlled Gene Transmission for Joint Order Batching and Picking Routing Problem Test Case Prioritization and Reduction Using Hybrid Quantum-behaved Particle Swarm Optimization
×
引用
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