{'fraction_non_alphanumeric': 0.013636363636363636, 'fraction_numerical': 0.0, 'mean_word_length': 5.476470588235294, '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}}
Association Rule Mining for Collaborative Recommender Systems

This thesis provides a novel approach to using data mining for e-commerce. The focus of our work is to apply association rule mining to collaborative recommender systems, which recommend articles to a user on the basis of other users’ ratings for these articles as well as the similarities between this user’s and other users’ tastes. In this work, we propose a new algorithm for association rule mining specially tailored for use in collaborative recommendation. We make recommendations by exploring associations between users, associations between articles, and a combination of the two. We experimentally evaluated our approach on real data for many different parameter settings and compared its performance with that of other approaches under similar experimental conditions. Through our analysis and experiments, we have found that association rules are quite appropriate for collaborative recommendation domains and that they can achieve a performance that is comparable to current state of the art in recommender systems research.