Effectively reducing the dimensionality of big data and retaining its key information has been a research challenge. As an important step in data pre-processing, feature selection plays a critical role in reducing data size and increasing the overall value of the data. Many previous studies have focused on single-label feature selection, however, with the increasing variety of data types, the need for feature selection on multi-label data types has also arisen. Unlike single-labeled data, multi-labeled data with more combinations of classifications place higher demands on the capabilities of feature selection algorithms. In this paper, we propose a filter-based Multi-Objective Equilibrium Optimizer algorithm (MOEO-Smp) to solve the feature selection problem for both single-label and multi-label data. MOEO-Smp rates the optimization results of solutions and features based on four pairs of optimization principles, and builds three equilibrium pools to guide exploration and exploitation based on the total scores of solutions and features and the ranking of objective fitness values, respectively. Seven UCI single-label datasets and two Mulan multi-label datasets and one COVID-19 multi-label dataset are used to test the feature selection capability of MOEO-Smp, and the feature selection results are compared with 10 other state-of-the-art algorithms and evaluated using three and seven different metrics, respectively. Feature selection experiments and comparisons with the results in other literatures show that MOEO-Smp not only has the highest classification accuracy and excellent dimensionality reduction on single-labeled data, but also performs better on multi-label data in terms of Hamming loss, accuracy, dimensionality reduction, and so on.

In order to better apply the cuckoo search (CS) algorithm in solving the problem of function extremum optimization, and further improve the phenomenon of low precision and slow convergence in the optimization process of algorithm, the two subpopulations CS algorithm based on mean value evaluation is proposed. On the one hand, the algorithm introduces dynamic inertia weight to adjust the lévy flight mechanism, thus dynamically constraining the moving step-size of each generation of population, so that the algorithm has certain self-adaptability. On the other hand, the algorithm changes the way of mutation in the preference random walk. First, the average fitness evaluation mechanism is used to divide the current population into two subpopulations: good and bad. Then, it adopts a directional mutation strategy for the better population, so that the individual can search purposefully. The worse population uses differential mutation mechanism of the disturbance items with the [Formula: see text]-distribution characteristics, and makes the individual to search in the best orientation of current, so as to enhance the local search performance and accelerate the convergence rate of the algorithm. Theoretical analysis proves the convergence and time complexity of the algorithm in this paper. The simulation results show that the improved algorithm has good applicability in solving the function optimization problem, and the optimization results and convergence speed have been significantly improved in the algorithm.