Preference-based learning to rank

DOI10.1007/s10994-010-5176-9zbMath1470.68069OpenAlexW2100644214MaRDI QIDQ1959596

Mehryar Mohri, Nir Ailon

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 rankROCmachine learning reductions

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)

Related Items (1)

An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust reductions from ranking to classification
• "Coherent Arbitrariness": Stable Demand Curves Without Stable Preferences
• 10.1162/1532443041827916
• Subset Ranking Using Regression
• An Alternative Ranking Problem for Search Engines
• Robust Reductions from Ranking to Classification
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Ranking Tournaments
• Learning Theory
• Learning Theory
• Aggregating inconsistent information
• Ordering by weighted number of wins gives a good ranking for weighted tournaments

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