Online Ranking by Projecting
- 1 January 2005
- journal article
- Published by MIT Press in Neural Computation
- Vol. 17 (1) , 145-175
- https://doi.org/10.1162/0899766052530848
Abstract
We discuss the problem of ranking instances. In our framework, each instance is associated with a rank or a rating, which is an integer in 1 to k. Our goal is to find a rank-prediction rule that assigns each instance a rank that is as close as possible to the instance's true rank. We discuss a group of closely related online algorithms, analyze their performance in the mistake-bound model, and prove their correctness. We describe two sets of experiments, with synthetic data and with the Each Movie data set for collaborative filtering. In the experiments we performed, our algorithms outperform online algorithms for regression and classification applied to ranking.Keywords
This publication has 6 references indexed in Scilit:
- 10.1162/jmlr.2003.4.6.933Applied Physics Letters, 2000
- Learning to Order ThingsJournal of Artificial Intelligence Research, 1999
- Large Margin Classification Using the Perceptron AlgorithmMachine Learning, 1999
- Exponentiated Gradient versus Gradient Descent for Linear PredictorsInformation and Computation, 1997
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmMachine Learning, 1988
- The perceptron: A probabilistic model for information storage and organization in the brain.Psychological Review, 1958