A binary dandelion algorithm using seeding and chaos population strategies for feature selection

Yuxin Zhao

doi:10.1016/j.asoc.2022.109166

2022-08-01

PRE

DOI：10.1016/j.asoc.2022.109166

原文链接

原文求助

摘要

En 中文

Feature selection (FS) is an important pre-processing step in data mining and pattern recognition. It can effectively compress the dimensionality of the feature space to reduce computation time and improve classification performance. The meta-heuristic algorithm-based feature selection method by finding the optimal set of features in the solution space has been widely used. However, this method is prone to trap into local optimality in a sufficiently large solution space. In this paper, we first propose a binary dandelion algorithm (BDA) to improve classification accuracy. In addition, to improve the performance of the algorithm, a binary dandelion algorithm using an improved seeding strategy and chaotic populations (SBDA) is proposed in this paper. Firstly, the strategy of optimizing the seeding radius by using the vibrational function and the historical optimal population increases the complexity of the search process and improves the search performance of the algorithm in the solution space. Secondly, when generating seeds, chaotic populations are generated using chaotic operators, which improves the ability of the algorithm to jump out of the local optimum and improves the stability of the algorithm. In this paper, 15 well-established datasets collected from the UCI machine learning database were adopted to compare four variants of BDA using only chaotic population improvement and in the next experiments, both mechanisms are verified to be effective in improving the performance of the algorithm. In addition, this paper compares the proposed BDA algorithm and SBDA algorithm with eight other classical algorithms. The experimental results show that SBDA can obtain fewer features with higher classification accuracy in most cases. (C) 2022 Elsevier B.V. All rights reserved.

Keyword:

Metaheuristic algorithm

Dandelion algorithm

Feature selection

Seeding strategy

Chaos algorithm