![]() |
CiteULike | ![]() |
dekrays's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Pranking with rankingby: Koby Crammer, Yoram Singer
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe discuss the problem of ranking instances. In our framework each instance is associated with a rank or a rating, which is an integer from 1 to k. Our goal is to nd a rank-prediction rule that assigns each instance a rank which is as close as possible to the instance's true rank. We describe a simple and ecient online algorithm, analyze its performance in the mistake bound model, and prove its correctness. We describe two sets of experiments, with synthetic data and with the EachMovie dataset for collaborative ltering. In the experiments we performed, our algorithm outperforms online algorithms for regression and classication applied to ranking. 1
BibTeX record
RIS record