{'fraction_non_alphanumeric': 0.015873015873015872, 'fraction_numerical': 0.003848003848003848, 'mean_word_length': 5.4, '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 recommendation algorithm based on product life cycle theory

A large number of practical applications of the recommendation system found that the novelty of the recommendation results and the user satisfaction are more closely related, making the novelty recommendation recently widely concerned and studied. Many novelty recommendation algorithms used the popularity of the item to measure novelty, but this method is too simple, and the change of item popularity is more reflective of its novelty. According to the product life cycle theory (PLC), this study proposed a novelty recommendation algorithm that recommends item that be not popular now and may be popular in the future to improve the novelty of the recommendation results, The time change of the popularity of the items to be recommended is analyzed, and the future popularity of the items are predicted by analogy. Two strategies for selecting recommended selection are selecting future popular items (the predicting popularity-based filtering Algorithm, PP algorithm) and excluding future recession items (the Excluding Recession-based filtering algorithm, ER algorithm), according to the definition of novelty of the item, recommended the novelty items to the target user. The effectiveness of the proposed algorithm was verified through an offline experiment. Results indicate that PP algorithm can significantly improve the accuracy and novelty, but seriously sacrifice the coverage and reduce the ability of the recommendation system to mine the long tail items when the number of alternative items N is small, the novelty of the recommendation list of the ER algorithm is remarkably higher than that of traditional algorithms, the novelty is high when the quantity of alternative sets reaches around 350, where the average popularity of the recommendation list declines by 40%, and the coverage is elevated by 150%, thereby improving the ability of the proposed system to extract all kinds of items. This study serves as reference for the improvement of user satisfaction with recommendation systems.