As data dimensions continue to increase, the challenges of data storage become more severe. While feature selection can reduce the complexity of high-dimensional data, existing methods are prone to local optima and high computational costs. To address these issues, this paper proposes a hybrid feature selection method based on MOPSO (Multi-Objective Particle Swarm Optimization). This method first uses a filter approach to narrow the search space, then employs a particle swarm algorithm to generate particles, incorporating mutation, crossover, and selection strategies during particle updates to enhance their search capabilities. Additionally, an archive set is established, utilizing grid-based and density-based methods during the update process to avoid local optima. Finally, the proposed method is compared with two single-objective optimization methods and two multi-objective optimization methods on multiple datasets. Experimental results demonstrate that the proposed method significantly reduces classification error rates and effectively reduces the number of features, providing an efficient solution for feature selection in high-dimensional data and addressing the challenges in high-dimensional data analysis.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

An Improved Multi-objective Particle Swarm Optimization Algorithm with Reduced Initial Search Space

  • Chu Zhiguang,
  • Fan Yingchen,
  • Zhang Xiaolei,
  • Zhang Ruyan,
  • Zhang Xing

摘要

As data dimensions continue to increase, the challenges of data storage become more severe. While feature selection can reduce the complexity of high-dimensional data, existing methods are prone to local optima and high computational costs. To address these issues, this paper proposes a hybrid feature selection method based on MOPSO (Multi-Objective Particle Swarm Optimization). This method first uses a filter approach to narrow the search space, then employs a particle swarm algorithm to generate particles, incorporating mutation, crossover, and selection strategies during particle updates to enhance their search capabilities. Additionally, an archive set is established, utilizing grid-based and density-based methods during the update process to avoid local optima. Finally, the proposed method is compared with two single-objective optimization methods and two multi-objective optimization methods on multiple datasets. Experimental results demonstrate that the proposed method significantly reduces classification error rates and effectively reduces the number of features, providing an efficient solution for feature selection in high-dimensional data and addressing the challenges in high-dimensional data analysis.