language-icon Old Web
English
Sign In

Learning to rank

Learning to rank or machine-learned ranking (MLR) is the application of machine learning, typically supervised, semi-supervised or reinforcement learning, in the construction of ranking models for information retrieval systems. Training data consists of lists of items with some partial order specified between items in each list. This order is typically induced by giving a numerical or ordinal score or a binary judgment (e.g. 'relevant' or 'not relevant') for each item. The ranking model's purpose is to rank, i.e. produce a permutation of items in new, unseen lists in a way which is 'similar' to rankings in the training data in some sense.Regularized least-squares based ranking. The work is extended in to learning to rank from general preference graphs. Learning to rank or machine-learned ranking (MLR) is the application of machine learning, typically supervised, semi-supervised or reinforcement learning, in the construction of ranking models for information retrieval systems. Training data consists of lists of items with some partial order specified between items in each list. This order is typically induced by giving a numerical or ordinal score or a binary judgment (e.g. 'relevant' or 'not relevant') for each item. The ranking model's purpose is to rank, i.e. produce a permutation of items in new, unseen lists in a way which is 'similar' to rankings in the training data in some sense. Ranking is a central part of many information retrieval problems, such as document retrieval, collaborative filtering, sentiment analysis, and online advertising.

[ "Ranking", "Ranking (information retrieval)", "normalized discounted cumulative gain", "Discounted cumulative gain" ]
Parent Topic
Child Topic
    No Parent Topic