An Efficient Boosting Algorithm for Combining Preferences
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
The Journal of Machine Learning Research
New approaches to support vector ordinal regression
ICML '05 Proceedings of the 22nd international conference on Machine learning
Subset ranking using regression
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Stability and generalization of bipartite ranking algorithms
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Margin-Based ranking meets boosting in the middle
COLT'05 Proceedings of the 18th annual conference on Learning Theory
ACM SIGACT News
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
An efficient algorithm for learning to rank from preference graphs
Machine Learning
Efficient AUC Maximization with Regularized Least-Squares
Proceedings of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008
A Sparse Regularized Least-Squares Preference Learning Algorithm
Proceedings of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008
Learning to Rank for Information Retrieval
Foundations and Trends in Information Retrieval
A general magnitude-preserving boosting algorithm for search ranking
Proceedings of the 18th ACM conference on Information and knowledge management
Learning dense models of query similarity from user click logs
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Learning to blend rankings: a monotonic transformation to blend rankings from heterogeneous domains
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Learning to re-rank web search results with multiple pairwise features
Proceedings of the fourth ACM international conference on Web search and data mining
Reducing position-sensitive subset ranking to classification
Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
Multi-task learning to rank for web search
Pattern Recognition Letters
Leveraging Auxiliary Data for Learning to Rank
ACM Transactions on Intelligent Systems and Technology (TIST)
Pairwise cross-domain factor model for heterogeneous transfer ranking
Proceedings of the fifth ACM international conference on Web search and data mining
Generic subset ranking using binary classifiers
Theoretical Computer Science
An Online Learning Framework for Refining Recency Search Results with User Click Feedback
ACM Transactions on Information Systems (TOIS)
Information Sciences: an International Journal
Robust ordinal regression in preference learning and ranking
Machine Learning
| Hi-index | 0.00 |
This paper studies the learning problem of ranking when one wishes not just to accurately predict pairwise ordering but also preserve the magnitude of the preferences or the difference between ratings, a problem motivated by its key importance in the design of search engines, movie recommendation, and other similar ranking systems. We describe and analyze several algorithms for this problem and give stability bounds for their generalization error, extending previously known stability results to non-bipartite ranking and magnitude of preference-preserving algorithms. We also report the results of experiments comparing these algorithms on several datasets and compare these results with those obtained using an algorithm minimizing the pairwise misranking error and standard regression.