{'fraction_non_alphanumeric': 0.021949078138718173, 'fraction_numerical': 0.0, 'mean_word_length': 5.745562130177515, '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 Neighborhood-Based Recommendation Algorithm Optimization with Clustering Analysis and Latent Factor Model

With the development of Internet, information overload about products is pervasive. It is important for commercial platforms to predict users’ preferences and recommend information. Neighborhood-based recommendation algorithm is one of the most popular methods, which are used to predict the rating of items that have not yet been rated. However, neighborhood-based algorithm suffers from data sparsity in practice, causing low accuracy. A recommendation algorithm is proposed in this paper, in which auxiliary information of users and items are utilized. Specifically, clustering method is introduced to divide users into categories, which reduces the time complexity of the algorithm, and latent factor model approach is applied to predict user-item matrix, which improves the accuracy of neighborhood-based algorithm. Experiments on real-world dataset demonstrate that the proposed KC-LFMCF approach is superior to the conventional neighborhood-based algorithm in terms of recommendation accuracy and time complexity.