Attribute Selection Method Based on Artificial Bee Colony Algorithm and Neighborhood Discrimination Matrix Optimization

Abstract

At present, the existing attribute reduction algorithm combining artificial bee colony and neighborhood rough set basically uses the attribute dependence and the number of attribute subsets as parameters to construct the fitness function, while ignoring the role of heuristic information. As a result, the number of bee colony iterations increases, and the convergence speed is slow. Aiming at this kind of problem, an improved method is proposed. First, a discernibility matrix under the neighborhood rough set is defined; secondly, an attribute importance measurement method of the discernibility matrix under the neighborhood decision system is proposed; The attribute importance of the domain discrimination matrix constructs a new fitness function for the heuristic factor; finally, an attribute selection algorithm for artificial bee colony algorithm and neighborhood discrimination matrix importance optimization is designed. Compared with the original algorithm, the new method reduces the number of generations, accelerates the convergence speed, and retains the minimum attribute reduction collected during each iteration, and multiple minimum attribute reductions can be obtained. The experimental results on the UCI data set prove the feasibility and effectiveness of the algorithm.