{'fraction_non_alphanumeric': 0.015306122448979591, 'fraction_numerical': 0.0, 'mean_word_length': 5.434426229508197, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An improved Particle Swarm Optimization algorithm applied to Benchmark Functions

According to the literature of Particle Swarm Optimization (PSO), there are problems of getting stuck at local minima and premature convergence with this algorithm. A new algorithm is presented in this paper called the Improved Particle Swarm Optimization using the gradient descent method as an operator incorporated into the Algorithm, as a function to achieve the improvement. The gradient descent method (BP Algorithm) helps not only to increase the global optimization ability, but also to avoid the premature convergence problem. The Improved PSO Algorithm IPSO is applied to Benchmark Functions. The results show that there is an improvement with respect to using the conventional PSO Algorithm.