Search

In the era of e-commerce, accurately predicting user purchase intentions has become a crucial factor for enhancing sales efficiency and optimizing the customer experience. Addressing the limitations of traditional ensemble strategies, which often suffer from subjective biases during the model design phase, this paper introduced an adaptive evolutionary ensemble learning model to predict user purchase intentions. This model adaptively selected the optimal base learners and meta-learners, incorporating both the predictive information from the base learners and the differential information between features to expand the feature dimensions, enhancing prediction accuracy. Moreover, to further refine the predictive capabilities of the model, this paper designed a binary adaptive differential evolution algorithm for feature selection, aiming to identify features that significantly influence the prediction outcome. Research results show that the binary adaptive differential evolution algorithm outperforms traditional optimization algorithms in global searches and feature selection. Compared to six common ensemble models and the DeepForest model, the proposed evolutionary ensemble model achieves a 2.76% and 2.72% increase in AUC value, respectively, and effectively mitigates the impacts of data imbalance [ABSTRACT FROM AUTHOR]

The multiple knapsack problem（MKP） is a special knapsack problem with great difficulty. In order to solve MKP by differential evolution（DE）, this paper first established the integer programming model of MKP. Based on a simple and efficient new transfer function based on modulo operation, it proposed a novel discrete differential evolution algorithm MODDE. Then, the method used an efficient algorithm GROA to eliminate the unfeasible solution of MKP by greedy strategy. Therefrom, this paper proposed a new method for solving MKP based on MODDE. Finally, it used MODDE to solve 30 international instances of MKP. Comparing with 4 representative evolution algorithms shows that MODDE not only has better calculation results; but also has stronger stability. It is indeed an efficient algorithm for solving MKP [ABSTRACT FROM AUTHOR]

The traditional differential evolution（DE） algorithm balanced global exploration and local exploitation inadequately, and had problems with easily falling into local optimal solutions, low solution accuracy and slow convergence speed. Therefore, this paper proposed a differential evolution algorithm based on random neighborhood mutation and optimal opposition-based learning（RNODE） and analyzed for its complexity. Firstly, the algorithm generated a random neighborhood for each individual in the current population, and used the global best individual to guide the neighborhood best individual to generate a composite basis vector, combined with an adaptive update mechanism of the control parameters to constitute a random neighborhood mutation strategy, which enabled the algorithm maintained its exploration ability and guided the population towards the optimal direction. Secondly, to further help the algorithm jump out of the local optimum, the algorithm performed the optimal opposition-based learning strategy on the poorer individuals to expand the search area. Finally, this paper compared RNODE with 9 algorithms to verify the effectiveness and advancement of RNODE. The experimental results on 23 benchmark functions and 2 real-world engineering optimization problems show that the RNODE algorithm has a higher convergence accuracy, faster speed and a greater stability. [ABSTRACT FROM AUTHOR]

With the aim of satisfaction of demand response, this paper proposed an improved polar bear optimization based approach for cost optimization on multi-tenant colocation data centers. This paper used a one-to-many reverse auction model to reveal the relationship between tenants and operator, and encouraged tenants to voluntarily participate in the auction and submit their energy-saving plans and expected rewards. Then, this algorithm adopted the improved polar bear algorithm to solve the optimal tenant combination and minimize the cost. In detail, this method leveraged the sigmoid function to process the discretize problem. Meanwhile, to enhance the ability of jumping out of the local optimum, it integrated a mutation strategy into the algorithm. To further improve the searching ability in a global view, the method designed an adaptive field of view strategy instead of fixed field of view to dynamically adjust the scope of the local search, and reduced the probability of the algorithm trapping into the local optimal solution. Finally, the paper compared the proposed algorithm with several classical algorithms. The experimental results show that the proposed algorithm not only gains the least cost alone, but also improves the efficiency. [ABSTRACT FROM AUTHOR]

In order to solve the problems of uneven resource utilization and long task completion time in complex task group scheduling, this paper constructed a complex task group resource scheduling model to minimize the mean square error of resource load and the task group completion time, and proposed a multi-objective optimization algorithm based on boundary range local search and NSGA-Ⅱ, called BRLSN. The algorithm used an effective coding method and cross mutation operator for iterative optimization, and constructed an elite retention strategy based on local search in boundary region to expand the search scope of the algorithm and preserved good individuals in the population. Experimental results show that compared with other multi-objective algorithms, the convergence and diversity of BRLSN are significantly improved. At the same time, the algorithm convergence speed is faster, the population quality is higher, and the result value of the final objective function is obviously optimized. [ABSTRACT FROM AUTHOR]

Aiming at the shortcoming of salp swarm optimization algorithm such as low accuracy, slow convergence speed and easy to fall into local optimum, this paper proposed an adaptive t-distribution and dynamic weight salp swarm optimization algorithm. Firstly, the leader position update introduced the global search stage formula of butterfly optimization algorithm to enhance the global exploration ability. Secondly, the follower location update introduced an adaptive dynamic weighting factor to strengthen the guiding role of elite individuals, so as to enhance the local development ability. Finally, the adaptive t-distribution mutation strategy mutated the optimal individual in order to avoid the algorithm falling into local optimum. By solving 12 benchmark test functions, and according to comparison results of the mean value, standard deviation, solving success rate, Wilcoxon test and convergence curve, the proposed algorithm was superior to standard salp swarm algorithm, the compared other improved salp swarm algorithm and the compared other swarm intelligence algorithms. The results also show that it has a significant improvement in the optimization accuracy and convergence speed, and has the ability to jump out of local optimum. The experimental results verify the effectiveness of the proposed algorithm by applying it to find the lowest point of denitrification inlet concentration. [ABSTRACT FROM AUTHOR]

In order to fix the integer ambiguity quickly and accurately, this paper proposed a new ambiguity search algorithm based on measurement accuracy constraints to solve the problems of the LAMBDA algorithm, such as the wide search range of the integer ambiguity and the low search efficiency. When the least squares problem got optimally weighted, the algorithm took the carrier phase measurement accuracy as the constraint condition to test the fixed ambiguity solution on the basis of the stan-dard differential evolution （DE） algorithm. This algorithm solved the influence of different satellite altitude angles, and could achieve 99% success rate when solving 3D integer ambiguity. Compared with the MLAMBDA algorithm, the standard DE algorithm and the adaptive weighted differential evolution （AWDE） algorithm, the proposed algorithm further improves the efficiency and success rate of ambiguity resolution. [ABSTRACT FROM AUTHOR]

In edge computing switching strategy, aiming at the problems of high transmission delay a nd poor environmental adaptability of Markov decision process ( MDP), this paper proposed an edge computing switching strategy integrating fuzzy logic a nd Markov decision process. The method used fuzzy logic algorithm to fuzzify the system parameters, and introduced the fuzzy value into the fitness function to ensure the effective fusion of system parameters. The differential evolution algorithm solved the maximum problem of fitness function, which could select the optimal rules of the environment and improve the adaptability of edge computing to the environment. The algorithm introduced the fitness function into MDP, which improved the comprehensive performance of the system. The scheme took the mobile intelligent device as the initiator of task unloading and the edge server as the object of task unloading. This paper simulated the one -dimensional MDP switching strategy, one-dimensional delay only MDP switching strategy, two-dimensional MDP switching strategy,fuzzy logic MDP switching strategy, minimum distance switching algorithm and minimum delay switching algorithm. The simulation results show that the average task execution time of the edge computing switching strategy of fuzzy logic MDP is 608 . 8 s, which a re 27. 2%,8. 6 %,37 . 1 %,41 % and 22. 3% lower than one -dimensional MDP switching strategy, one-dimensional delay only MDP switching strategy, two-dimensional MDP switching strategy, minimum distance switching algorithm and minimum delay switching algorithm respectively. This scheme not only improves the environmental adaptability of the edge computing switching strategy based on MDP, but also greatly reduces the transmission delay of edge computing. [ABSTRACT FROM AUTHOR]

Targeting to the deficiency of sparrow search algorithm solved the multi-objective problems, and the problems can easily enter the partial optimization and inferior convergence in the counting process, this paper came up with a kind of improved multi-objective sparrow search algorithm. First of all, this paper used a new-type non-dominated sorting to find the Pareto front. Next, it integrated the polynomial mutation and cosine algorithm into species evolution strategy to strengthen its searching ability. It used the species selection method of competition mechanism to decrease the differentiation caused by partial optimized particle and overall optimized particle in the searching process. Finally, this paper compared the improved algorithm and various kinds of multi-objective algorithm in standard test function. The simulation results show that, the convergence and searching ability of the improved algorithm are all superior than other algorithm. Therefore, this algorithm can effectively address the multiple target optimization problem. [ABSTRACT FROM AUTHOR]

In order to protect personal information in images, this paper proposed an adversarial image perturbations algorithm to combat deep neural network, which could mine and discover personal image knowledge. It transformed the problem of adversarial example generation into a multi-objective optimization problem with constraints. Considering the classification confidence of the neural network, the location of the perturbed pixels and the chromatic aberration, this paper obtained the adversarial examples iteratively by using the differential evolution algorithm. On MNIST and CIF AR-10 dataset, based on deep neural network LeN et and ResN et, the algorithm generated the experiment of adversarial examples. This paper compared and analyzed the success rate, number of perturbation pixels, optimization effects and spatial characteristics of the adversarial examples. The results show that the proposed algorithm still can effectively combat the deep neural network in the case of few disturbed pixels ( the average number of perturbation pixels is 5) . The algorithm significantly optimizes the location and chromatic aberration of the perturbed pixels, so as to protect personal information without destroying the original image. This study is helpful to balance the relationship between information technology dividend sharing and personal information security, and provides technical support for the research of adversarial examples generation and classification spatial features in deep neural networks. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of aquila optimization algorithm（AO）, this paper proposed an aquila optimization algorithm using hybrid search strategy. Firstly, the algorithm introduced dynamic adjustment function to balance global exploration and local exploitation; Secondly, it introduced chaotic adaptive weights to enhance the global search capability of the algorithm and accelerate the convergence speed of the algorithm; Thirdly, it introduced a new individual mutation probability coefficient and an improved differential mutation strategy, and used individuals with better fitness values to lead other individuals in the population to carry out search activities, which maintained the diversity of the population and enhanced the ability of the algorithm to jump out of the local optimum. Through the numerical experiment simulation of 8 benchmark test functions, 10 CEC2019 test functions and 1 engineering application problem, The experimental results show that the algorithm has a significant improvement in global convergence speed and optimization accuracy, and has a better ability to jump out of the local optimum. [ABSTRACT FROM AUTHOR]

In the field of mobile App just-in-time ( JIT) defect prediction, most studies only focus on the performance of the prediction model but ignore the interpretability of the model. Therefore, developers will lack trust in the prediction results of the defect prediction model and hinder the application of the defect prediction model in practice. This paper studied the interpretability of the mobile App JIT defect prediction model. And it proposed the method ExplainApp by hyperparameter optimization of the local interpretability technology LIME method via a differential evolution algorithm, which could generate explanations for the prediction results. This study selected 14 real-world Android applications as preposed experimental objects. The final results show that, the method ExplainApp can explain the prediction results of the instance generated by the mobile A pp JIT defect prediction model. And the method ExplainApp is superior to the original LIME method in terms of the goodness of fit. Specifically, the performance can improve by 94. 50% on average. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of normal SPBO, this paper analyzed the psychological characteristics of students ' learning, and put forward an improved student psychology based optimization algorithm ( HSSPBO) using hybrid strategy . Firstly, it took the inverse value of student ' s test scores as the fitness value of the student, and took the fitness value of the best students in the class as the benchmark, and then divided the students in the class into four categories : the best students, the good students, the ordinary students and the students who tried random improvement. Secondly, it used the dynamic switching probability of sine square and cosine square to balance global exploration and local development, so that the global exploration ability and local exploitation ability of the algorithm were improved effectively. Thirdly, by introducing Cauchy mutation strategy to change the local search step size, it improved effectively the local search ability of the algorithm and enhanced the ability of the algorithm to jump out of the local optimization. Finally, the HSSPBO algorithm used Levy flight strategy to make the individual search step length more random and flexible, which effectively enhanced the individual ' s searching ability, and further improved the optimization speed of the algorithm. Through simulation experiments of 12 benchmark functions and comparison with six optimization algorithms, the results show that HSSPBO ' s global search ability has been significantly improved, and it has faster global convergence speed, better optimization accuracy and stability in function optimization. [ABSTRACT FROM AUTHOR]

In order to improve the convergence and diversity of the non-dominated solution set of multi-objective optimization problems, and solve the problem that the algorithm is easy to fall into the local optimum in the later stage, according to the characteristics of different differential evolution strategies, this paper added random disturbances, and proposed a decomposition multi-objective evolution algorithm with adaptive differential evolution strategy based on the improved Chebyshev mechanism (MOEA/D-ADE-levy). Firstly, it used the mixed-level orthogonal experiment to generate uniform weight vectors and applied to improve the Chebyshev mechanism to decompose the sub-problems to obtain a uniformly distributed initial population. Secondly, it divided the population into excellent individuals, intermediate individuals and poor individuals, and used different individuals. The mutation strategy used an adaptive mechanism for the mutation factor F and the crossover probability CR to improve the convergence and diversity of the non-dominated solution set. Finally, it added the Lévy random perturbation to the solution set that fell into the local optimum to increase its global search ability, and jumped out of the local optimum. The DTLZ test function was used to verify the effectiveness of the algorithm. And the proposed algorithm was compared with common algorithms such as NSGA2, NSGA3, MOEA/D, MOEA/D-DE, etc.. And the diversity and convergence analysis of the algorithm was performed using GD and IGD evaluation indicators. The results show that the algorithm has been improved and improved in terms of convergence and diversity, and can obtain a better Pareto solution set. [ABSTRACT FROM AUTHOR]

When calculating similarity, the existing differential privacy recommendation algorithms directly calculate based on user-scheme data, but ignore the influence of scheme attributes on user preferences, fail to reflect the real preferences of users, and cannot make accurate recommendations. To solve this problem, this paper proposed differential privacy recommendation method considering user interest analysis. In this method, it collected firstly users' interest ratings for scheme attributes, and secondly clustered the user-scheme attributes rating data by K-means + +. Then, it used the differential privacy algorithm to select the nearest users, and recommended suitable schemes for the target user. Finally, taking the recommendation of nursing home schemes as an example, the experimental results show that compared with KDPC, DPCF and PNCF, the proposed algorithm can reduce the mean absolute error by about 19. 0%, 34. 0% and 37. 7% under the same privacy budget. The mean absolute error decreases by 10. 4%, 20. 3 % and 21. 4 % for the same size of the nearest neighbor set. Therefore, based on protecting the privacy of users, the algorithm further improves the recommendation accuracy. [ABSTRACT FROM AUTHOR]

As many intelligent devices become the component of the Internet of Things system, the system' s architectural form and scale are showing diversified and huge characteristics . The performance of an IoT system depends on its own organizational structure . Therefore, the optimization of the organizational structure of the Internet of Things system is particularly important. Because the essence of the system architecture is the problem of the arrangement and combination of system nodes, this paper converted the system architecture problem into the optimization problem of the system utility value, and proposed a solution algorithm based on immune evolution. The algorithm used a hierarchical coding method to transform the system organization structure into an integer coding form. It designed an adaptive hierarchical crossover operator and as mall perturbation mutation operator, and used the degree of individual stimulation to guide the search direction of the algorithm and search for the algorithm that met the performance requirements. Experimental results show that this algorithm can obtain a system structure with high efficiency, and has excellent performance in success rate, relative error rate and convergence speed. [ABSTRACT FROM AUTHOR]