Learning to Rank --A Brief Review课件.pptVIP

Learning to Rank --A Brief Review Yunpeng Xu Ranking and sorting Rank: only has K structured categories Sorting: each sample has a distinct rank Generally, no need to differentiate them Overview Rank aggregation Label ranking Query and rank by example Preference learning Problems left, what we can do? Ranking aggregation Needs of combining different ranking results Voting systems, welfare economics, decision making 1. Hillary Clinton John Edwards Barack Obama 2. Barack Obama John Edwards Hillary Clinton = ? Ranking aggregation (cont.) Arrow’s impossibility theorem Kenneth Arrow, 1951 Ranking aggregation (cont.) Arrow’s impossibility theorem 5 fair assumptions non-dictatorship, unrestricted domain or universality, independence of irrelevant alternatives, positive association of social and individual values or monotonicity, non-imposition or citizen sovereignty Cannot be satisfied simultaneously Ranking aggregation (cont.) Borda’s method (1971) Given lists , each has n items For each Define as the number of items rank below j in Rank all items by Hillary Clinton: 2, John Edwards: 2, Barack Obama: 2 Ranking aggregation (cont.) -- Border Condorcet Criteria If the majority prefers x to y, then x must be ranked above y Border’s method does not satisfy CC, neither any method that assigns weights to each rank position Ranking aggregation (cont.) Assumption relaxation Maximize consensus criteria Equivalent to minimize disagreement (Kemeny, Social Choice Theorem) NP Hard! Sub-optimal solutions using heuristics Ranking aggregation (cont.) Basic idea Assign different weights to different experts Supervised aggregation Weighting according to a final judger (ground truth) Unsupervised aggregation Aims to minimize the disagreement measured by certain distances Ranking aggregation (cont.) Distance measure Spearman footrule distance Kendal tau distance Kendal tau distance for multiple lists Scaled footrule distance Ranking aggregation (c