Sushovan Chaudhury, O. J. Oyebode, Dai-Long Ngo Hoang, F. Rabbi, S. Ajibade
{"title":"混沌元启发式优化技术的特征选择","authors":"Sushovan Chaudhury, O. J. Oyebode, Dai-Long Ngo Hoang, F. Rabbi, S. Ajibade","doi":"10.1109/CSPA55076.2022.9781989","DOIUrl":null,"url":null,"abstract":"Particle swarm optimization (PSO) is a global optimization method that is extremely effective. PSO's flaws include slow convergence, premature convergence, and getting stuck at local optima. In this paper, the chaos map and dynamic-weight Particle Swarm Optimization (CPSO) are combined with PSO to improve the search process by adjusting the inertia weight of PSO and changing the position update formula in the Chaos dynamic-weight Particle Swarm Optimization (CPSO), resulting in efficient balancing for local and global PSO feature selection processes. Using eight numerical functions, the performance of CPSO was compared to that of two metaheuristic techniques which are the original PSO and Differential Evolution (DE). The results reveal that the CPSO is an efficient feature selection technique that generates good results by balancing the exploration and exploitation search processes.","PeriodicalId":174315,"journal":{"name":"2022 IEEE 18th International Colloquium on Signal Processing & Applications (CSPA)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Feature Selection for Metaheuristics Optimization Technique with Chaos\",\"authors\":\"Sushovan Chaudhury, O. J. Oyebode, Dai-Long Ngo Hoang, F. Rabbi, S. Ajibade\",\"doi\":\"10.1109/CSPA55076.2022.9781989\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Particle swarm optimization (PSO) is a global optimization method that is extremely effective. PSO's flaws include slow convergence, premature convergence, and getting stuck at local optima. In this paper, the chaos map and dynamic-weight Particle Swarm Optimization (CPSO) are combined with PSO to improve the search process by adjusting the inertia weight of PSO and changing the position update formula in the Chaos dynamic-weight Particle Swarm Optimization (CPSO), resulting in efficient balancing for local and global PSO feature selection processes. Using eight numerical functions, the performance of CPSO was compared to that of two metaheuristic techniques which are the original PSO and Differential Evolution (DE). The results reveal that the CPSO is an efficient feature selection technique that generates good results by balancing the exploration and exploitation search processes.\",\"PeriodicalId\":174315,\"journal\":{\"name\":\"2022 IEEE 18th International Colloquium on Signal Processing & Applications (CSPA)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 18th International Colloquium on Signal Processing & Applications (CSPA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSPA55076.2022.9781989\",\"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 18th International Colloquium on Signal Processing & Applications (CSPA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSPA55076.2022.9781989","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Feature Selection for Metaheuristics Optimization Technique with Chaos
Particle swarm optimization (PSO) is a global optimization method that is extremely effective. PSO's flaws include slow convergence, premature convergence, and getting stuck at local optima. In this paper, the chaos map and dynamic-weight Particle Swarm Optimization (CPSO) are combined with PSO to improve the search process by adjusting the inertia weight of PSO and changing the position update formula in the Chaos dynamic-weight Particle Swarm Optimization (CPSO), resulting in efficient balancing for local and global PSO feature selection processes. Using eight numerical functions, the performance of CPSO was compared to that of two metaheuristic techniques which are the original PSO and Differential Evolution (DE). The results reveal that the CPSO is an efficient feature selection technique that generates good results by balancing the exploration and exploitation search processes.