{'fraction_non_alphanumeric': 0.027237354085603113, 'fraction_numerical': 0.0, 'mean_word_length': 5.198795180722891, '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}}
Model-Based Learning from Preference Data

Preference data occur when assessors express comparative opinions about a set of items, by rating, ranking, pair comparing, liking, or clicking. The purpose of preference learning is to ( a) infer on the shared consensus preference of a group of users, sometimes called rank aggregation, or ( b) estimate for each user her individual ranking of the items, when the user indicates only incomplete preferences; the latter is an important part of recommender systems. We provide an overview of probabilistic approaches to preference learning, including the Mallows, Plackett–Luce, and Bradley–Terry models and collaborative filtering, and some of their variations. We illustrate, compare, and discuss the use of these methods by means of an experiment in which assessors rank potatoes, and with a simulation. The purpose of this article is not to recommend the use of one best method but to present a palette of different possibilities for different questions and different types of data.