Design of classification model on high-dimensional imbalance data of motor bearing fault

According to the characteristics of high-dimensional imbalance distribution of motor bearing fault data, a design scheme of classification model is proposed for the high-dimensional data reduction problem in the classification algorithm. For details: Combining standard particle swarm optimization algorithm and random forest algorithm, a new high-dimensional data reduction algorithm is proposed. Aiming at the imbalance problem of data categories in the classification algorithm, we proposes to use machine learning under the sum of squares of dynamic deviations criterion to divide the minority sample data set into mixed regions, high-purity minority sample regions and outlier regions, and then use smote algorithm to complete the data equalization processing, so as to make the sample data equalization processing more reasonable, Focusing on the task of motor bearing fault classification, a design scheme of using standard particle swarm optimization algorithm to improve the least squares support vector machine model is proposed.

A Dynamic Multi-Swarm Particle Swarm Optimization with Global Detection Mechanism

To overcome the shortcomings of the standard particle swarm optimization algorithm (PSO), such as premature convergence and low precision, a dynamic multi-swarm PSO with global detection mechanism (DMS-PSO-GD) is proposed. In DMS-PSO-GD, the whole population is divided into two kinds of sub-swarms: several same-sized dynamic sub-swarms and a global sub-swarm. The dynamic sub-swarms achieve information interaction and sharing among themselves through the randomly regrouping strategy. The global sub-swarm evolves independently and learns from the optimal individuals of the dynamic sub-swarm with dominant characteristics. During the evolution process of the population, the variances and average fitness values of dynamic sub-swarms are used for measuring the distribution of the particles, by which the dominant one and the optimal individual can be detected easily. The comparison results among DMS-PSO-GD and other 5 well-known algorithms suggest that it demonstrates superior performance for solving different types of functions.

Smart City Landscape Design Based on Improved Particle Swarm Optimization Algorithm

Aiming at the shortcomings of standard particle swarm optimization (PSO) algorithms that easily fall into local optimum, this paper proposes an optimization algorithm (LTQPSO) that improves quantum behavioral particle swarms. Aiming at the problem of premature convergence of the particle swarm algorithm, the evolution speed of individual particles and the population dispersion are used to dynamically adjust the inertia weights to make them adaptive and controllable, thereby avoiding premature convergence. At the same time, the natural selection method is introduced into the traditional position update formula to maintain the diversity of the population, strengthen the global search ability of the LTQPSO algorithm, and accelerate the convergence speed of the algorithm. The improved LTQPSO algorithm is applied to landscape trail path planning, and the research results prove the effectiveness and feasibility of the algorithm.

Hybrid crow search and uniform crossover algorithm-based clustering for top-N recommendation system

Recommender systems (RSs) have gained immense popularity due to their capability of dealing with a huge amount of information available in various domains. They are considered to be information filtering systems that make predictions or recommendations to users based on their interests. One of the most common recommender system techniques is user-based collaborative filtering. In this paper, we follow this technique by proposing a new algorithm which is called hybrid crow search and uniform crossover algorithm (HCSUC) to find a set of feasible clusters of similar users to enhance the recommendation process. Invoking the genetic uniform crossover operator in the standard crow search algorithm can increase the diversity of the search and help the algorithm to escape from trapping in local minima. The top-N recommendations are presented for the corresponding user according to the most feasible cluster’s members. The performance of the HCSUC algorithm is evaluated using the Jester dataset. A set of experiments have been conducted to validate the solution quality and accuracy of the HCSUC algorithm against the standard particle swarm optimization (PSO), African buffalo optimization (ABO), and the crow search algorithm (CSA). In addition, the proposed algorithm and the other meta-heuristic algorithms are compared against the collaborative filtering recommendation technique (CF). The results indicate that the HCSUC algorithm has obtained superior results in terms of mean absolute error, root means square errors and in minimization of the objective function.

Developing a New Robust Swarm-Based Algorithm for Robot Analysis

Metaheuristics are incapable of analyzing robot problems without being enhanced, modified, or hybridized. Enhanced metaheuristics reported in other works of literature are problem-specific and often not suitable for analyzing other robot configurations. The parameters of standard particle swarm optimization (SPSO) were shown to be incapable of resolving robot optimization problems. A novel algorithm for robot kinematic analysis with enhanced parameters is hereby presented. The algorithm is capable of analyzing all the known robot configurations. This was achieved by studying the convergence behavior of PSO under various robot configurations, with a view of determining new PSO parameters for robot analysis and a suitable adaptive technique for parameter identification. Most of the parameters tested stagnated in the vicinity of strong local minimizers. A few parameters escaped stagnation but were incapable of finding the global minimum solution, this is undesirable because accuracy is an important criterion for robot analysis and control. The algorithm was trained to identify stagnating solutions. The algorithm proposed herein was found to compete favorably with other algorithms reported in the literature. There is a great potential of further expanding the findings herein for dynamic parameter identification.

Dynamic search fireworks algorithm with chaos

As a relatively new algorithm for swarm intelligence, fireworks algorithm imitates the explosion process of fireworks. A different amplitude in dynamic search fireworks algorithm is presented for an improvement of enhanced fireworks algorithm. This paper integrates chaos with the dynamic search fireworks algorithm so as to further improve the performance and achieve global optimization. Three different variants of dynamic search fireworks algorithm with chaos are introduced and 10 chaotic maps are used to tune either the amplification coefficient [Formula: see text] or the reduction coefficient [Formula: see text]. Twelve benchmark functions are verified in use of the dynamic search fireworks algorithm with chaos (dynamic search fireworks algorithm). The dynamic search fireworks algorithm significantly outperformed the Fireworks Algorithm, enhanced fireworks algorithm, and dynamic search fireworks algorithm based on solution accuracy. The highest performance was seen when dynamic search fireworks algorithm was used with a Gauss/mouse map to tune Ca. Additionally, the dynamic search fireworks algorithm was compared with the firefly algorithm, harmony search, bat algorithm, and standard particle swarm optimization (SPSO2011). Study results indicated that the dynamic search fireworks algorithm has the highest accuracy solution among the five algorithms.

POLAR PARTICLE SWARM OPTIMIZATION ALGORITHM FOR SOLVING OPTIMAL REACTIVE POWER PROBLEM

This paper presents Polar Particle Swarm optimization (PPSO) algorithm for solving optimal reactive power problem. The standard Particle Swarm Optimization (PSO) algorithm is an innovative evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous best to optimize problems. In the proposed PPSO algorithm that enhances the behaviour of PSO and avoids the local minima problem by using a polar function to search for more points in the search space in order to evaluate the efficiency of proposed algorithm, it has been tested on IEEE 30 bus system and compared to other algorithms. Simulation results demonstrate good performance of the Polar Particle Swarm optimization (PPSO) algorithm in solving an optimal reactive power problem.