{'fraction_non_alphanumeric': 0.02066115702479339, 'fraction_numerical': 0.0, 'mean_word_length': 5.178571428571429, '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}}
Improve performance of collaborative filtering systems using backward feature selection

In E-Commerce, recommender systems recommend to users those items that may they like and have not been seen by them. One of the most popular techniques in recommender systems is collaborative filtering. For the current user, collaborative filtering technique uses the rating information of similar users to recommends new items. Therefore, clustering methods can be performed to divide users into k clusters as users of each cluster are similar. In this paper, k-means clustering method is used to cluster users based on user-item matrix. But, the sparsity of user-item matrix leads to produce incorrect similarity values between different users. To decrease this undesirable effect, removing some of the items with much more zero rates than the other items, can be done before clustering method. By eliminating these features, k-means clustering produces clusters which include more similar users. In this paper, backward feature selection is used to remove the irrelevant features of user-item matrix. Simulation results on MovieLens dataset indicate that this method improves the performance of the recommender system.