{'fraction_non_alphanumeric': 0.0219435736677116, 'fraction_numerical': 0.0, 'mean_word_length': 5.203883495145631, '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 competition-based recommender system

There are a large number of items with users' ratings on the internet. Instead of predicting items' ratings with the item content or the user-item-rating matrix, this paper proposes an approach to predict items' ratings basing on paired comparisons among contents of items with different ratings. We assume that the user interest on each item can be represented by the combination of different content features, and employ Bradley-Terry model to confirm the user interest value of each feature. Experimental results show that the competition-based recommender system outperforms popular approaches.