Preference-based learning to rank
From MaRDI portal
Publication:1959596
DOI10.1007/S10994-010-5176-9zbMATH Open1470.68069OpenAlexW2100644214MaRDI QIDQ1959596FDOQ1959596
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
Recommendations
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Randomized algorithms (68W20) Searching and sorting (68P10)
Cites Work
- Title not available (Why is that?)
- Robust Reductions from Ranking to Classification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ranking Tournaments
- 10.1162/1532443041827916
- Aggregating inconsistent information
- Learning Theory
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Ranking the best instances
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Learning Theory
- "Coherent Arbitrariness": Stable Demand Curves Without Stable Preferences
- Robust reductions from ranking to classification
- Ordering by weighted number of wins gives a good ranking for weighted tournaments
- An Alternative Ranking Problem for Search Engines
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Subset Ranking Using Regression
- Existence of nonnegative solutions for nonlinear boundary value problems via pseudomonotone operators and nonsmooth critical point theory
Cited In (22)
- Advances in Intelligent Data Analysis VI
- Preference Learning and Ranking by Pairwise Comparison
- 10.1162/1532443041827916
- Learning Theory and Kernel Machines
- Label ranking: a new rule-based label ranking method
- Generic subset ranking using binary classifiers
- Efficiently learning the preferences of people
- Title not available (Why is that?)
- Editorial: Preference learning and ranking
- Semi-supervised Learning to Rank with Nonlinear Preference Model
- An Alternative Ranking Problem for Search Engines
- Kernel-based learning methods for preference aggregation
- An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity
- Pairwise preference learning and ranking.
- Efficient learning of sparse ranking functions
- An efficient algorithm for learning to rank from preference graphs
- Learning Theory
- An optimal algorithm to find champions of tournament graphs
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
- The asymptotics of ranking algorithms
- Reduction from cost-sensitive ordinal ranking to weighted binary classification
- Learning Preference Models in Recommender Systems
Uses Software
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)
