{'fraction_non_alphanumeric': 0.010731707317073172, 'fraction_numerical': 0.0, 'mean_word_length': 5.7947019867549665, '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}}
A Novel Modified Sparrow Search Algorithm Based on Adaptive Weight and Improved Boundary Constraints

A novel modified sparrow search algorithm based on adaptive weight and improved boundary constraints is proposed to tackle disadvantages of sparrow search algorithm, which tends to fall into local optimum and has limited convergence speed. The convergence speed of algorithm is improved by adaptive weight, and the improved boundary handling strategy improves the convergence accuracy of algorithm to a certain extent. In order to verify the effectiveness of improved algorithm, a total of nine benchmark test functions of three types were calculated, and the ant lion optimizer, seagull optimization algorithm, tunicate swarm algorithm and standard sparrow search algorithm were compared and analyzed statistically. The simulation results indicate that the improved algorithm can overcome precocious convergence problem effectively, and is superior to the other four algorithms in terms of convergence speed and precision.