{'fraction_non_alphanumeric': 0.015748031496062992, 'fraction_numerical': 0.0, 'mean_word_length': 5.793893129770993, '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 Personalization Recommendation Algorithm for E-Commerce

Many recommendation systems employ the collaborative filtering technology, which has been proved to be one of the most successful techniques in recommendation systems in recent years, the difficulties of the extreme sparsity of user rating data have become more and more severe. To solve the problems of scalability and sparsity in the collaborative filtering, this paper proposed a personalization recommendation algorithm based on rough set which is proposed, The algorithm refine the user ratings data with dimensionality reduction, then uses a new similarity measure to find the target users’ neighbors, then generates recommendations. To prove our algorithm’s effectiveness, the authors conduct experiments on the public dataset. Theoretical analysis and experimental results show that this method is efficient and effective.