{'fraction_non_alphanumeric': 0.02981029810298103, 'fraction_numerical': 0.0040650406504065045, 'mean_word_length': 6.038095238095238, '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}}
Decomposition-based Multi-objective Backtracking Search Algorithm for Personalized Recommendation

In this paper, a decomposition-based multi-objective backtracking search algorithm (DMOBSA) is proposed for personalized recommendation (PR) problems. In the proposed DMOBSA-PR, an effective individual representation is designed based on the characteristics of PR problems. Moreover, the new crossover and mutation operation in the framework of the BSA algorithm are introduced to update individuals. Furthermore, a decomposition-based multi-objective framework is utilized to balance accuracy and diversity metrics. Finally, the simulation results on Movielens 100K dataset show that DMOBSA-PR is effective compared with other algorithms.