An Improved Multi-objective Particle Swarm Optimization with Adaptive Penalty Value for Feature Selection

Feature selection is an important data-preprocessing technique to eliminate the features with low contributions in classification. Currently, many researches focus their interests on the combination of feature selection and multi-objective particle swarm optimization (PSO). However, these methods exist the problems of large search space and the loss of global search. This paper proposes a multi-objective particle swarm optimization with the method called APPSOFS that the leader archive is updated by an adaptive penalty value mechanism based on PBI parameter. Meanwhile, the random generalized opposition-based learning point (GOBL-R) point is adopted to help jump out of local optima. The proposed method is compared with three multi-objective PSO and MOEA/D on six benchmark datasets. The results have demonstrated that the proposed method has better performance on feature selection.

[1]  R. Lyndon While,et al.  A faster algorithm for calculating hypervolume , 2006, IEEE Transactions on Evolutionary Computation.

[2]  Zhijian Wu,et al.  Enhanced opposition-based differential evolution for solving high-dimensional continuous optimization problems , 2011, Soft Comput..

[3]  Jun Tang,et al.  On the improvement of opposition-based differential evolution , 2010, 2010 Sixth International Conference on Natural Computation.

[4]  Alper Ekrem Murat,et al.  A discrete particle swarm optimization method for feature selection in binary classification problems , 2010, Eur. J. Oper. Res..

[5]  Shengxiang Yang,et al.  Improving the multiobjective evolutionary algorithm based on decomposition with new penalty schemes , 2017, Soft Comput..

[6]  Shengxiang Yang,et al.  A decomposition-based multiobjective evolutionary algorithm with angle-based adaptive penalty , 2019, Appl. Soft Comput..

[7]  Charles X. Ling,et al.  Using AUC and accuracy in evaluating learning algorithms , 2005, IEEE Transactions on Knowledge and Data Engineering.

[8]  Yaochu Jin,et al.  A Competitive Swarm Optimizer for Large Scale Optimization , 2015, IEEE Transactions on Cybernetics.

[9]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[10]  Peter J. Fleming,et al.  Methods for multi-objective optimization: An analysis , 2015, Inf. Sci..

[11]  Mengjie Zhang,et al.  New mechanism for archive maintenance in PSO-based multi-objective feature selection , 2016, Soft Comput..

[12]  Yaochu Jin,et al.  A competitive mechanism based multi-objective particle swarm optimizer with fast convergence , 2018, Inf. Sci..

[13]  Qingfu Zhang,et al.  Constrained Subproblems in a Decomposition-Based Multiobjective Evolutionary Algorithm , 2016, IEEE Transactions on Evolutionary Computation.

[14]  George D. C. Cavalcanti,et al.  A global-ranking local feature selection method for text categorization , 2012, Expert Syst. Appl..

[15]  Behrouz Minaei-Bidgoli,et al.  Optimizing multi-objective PSO based feature selection method using a feature elitism mechanism , 2018, Expert Syst. Appl..

[16]  Shahryar Rahnamayan,et al.  Opposition based learning: A literature review , 2017, Swarm Evol. Comput..

[17]  Li-Yeh Chuang,et al.  Chaotic maps based on binary particle swarm optimization for feature selection , 2011, Appl. Soft Comput..

[18]  Jian Cheng,et al.  Multi-Objective Particle Swarm Optimization Approach for Cost-Based Feature Selection in Classification , 2017, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[19]  Mengjie Zhang,et al.  Particle Swarm Optimization for Feature Selection in Classification: A Multi-Objective Approach , 2013, IEEE Transactions on Cybernetics.

[20]  Carlos A. Coello Coello,et al.  A particle swarm optimizer for multi-objective optimization , 2005 .