Preference-based learning to rank

DOI10.1007/S10994-010-5176-9MaRDI QIDQ1959596zbMATH OpenOpenAlexFDO

Authors Nir Ailon, Mehryar Mohri

Publication date 7 October 2010

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-010-5176-9

zbMATH Keywords

learning to rankmachine learning reductionsROC

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Searching and sorting (68P10) Learning and adaptive systems in artificial intelligence (68T05) Randomized algorithms (68W20)

Recommendations

• Pairwise preference learning and ranking.
• An efficient algorithm for learning to rank from preference graphs
• An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity
• Label ranking by learning pairwise preferences
• 10.1162/1532443041827916

Cites work

• "Coherent Arbitrariness": Stable Demand Curves Without Stable Preferences
• 10.1162/1532443041827916
• Aggregating inconsistent information
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• An Alternative Ranking Problem for Search Engines
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Deterministic pivoting algorithms for constrained ranking and clustering problems
• Existence of nonnegative solutions for nonlinear boundary value problems via pseudomonotone operators and nonsmooth critical point theory
• scientific article; zbMATH DE number 5485441 (Why is no real title available?)
• scientific article; zbMATH DE number 3551712 (Why is no real title available?)
• scientific article; zbMATH DE number 1288298 (Why is no real title available?)
• Learning Theory
• Learning Theory
• Ordering by weighted number of wins gives a good ranking for weighted tournaments
• Ranking the best instances
• Ranking Tournaments
• Robust reductions from ranking to classification
• Robust Reductions from Ranking to Classification
• Subset Ranking Using Regression

Cited in

(23)

• Kernel-based learning methods for preference aggregation
• Efficiently learning the preferences of people
• An efficient algorithm for learning to rank from preference graphs
• Editorial: Preference learning and ranking
• The asymptotics of ranking algorithms
• An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
• Reduction from cost-sensitive ordinal ranking to weighted binary classification
• scientific article; zbMATH DE number 2089757 (Why is no real title available?)
• Preference Learning and Ranking by Pairwise Comparison
• Learning Preference Models in Recommender Systems
• Label ranking: a new rule-based label ranking method
• scientific article; zbMATH DE number 1315581 (Why is no real title available?)
• 10.1162/1532443041827916
• Semi-supervised Learning to Rank with Nonlinear Preference Model
• Efficient learning of sparse ranking functions
• Learning Theory and Kernel Machines
• An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity
• An Alternative Ranking Problem for Search Engines
• Learning Theory
• Pairwise preference learning and ranking.
• Advances in Intelligent Data Analysis VI
• An optimal algorithm to find champions of tournament graphs
• Generic subset ranking using binary classifiers

Describes a project that uses

Uses Software

• Quicksort

This page was built for publication: Preference-based learning to rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1959596)