{'fraction_non_alphanumeric': 0.013182674199623353, 'fraction_numerical': 0.011299435028248588, 'mean_word_length': 5.045454545454546, '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 for solving 0–1 Knapsack problem

According to the correlation and dependence among items in 0-1 knapsack problem, this paper proposes an mproved PSO based on probability model to solve the problem. The algorithm proposes a new updating equation and operates on the probability vector according to the statistic probability to perform the evolution. The example shows that this algorithm has a faster convergence rate and a higher rate of success to solve the 0-1 knapsack problem.