Online ranking by projecting
Related Experiment Videos
1School of Computer Science and Engineering, Hebrew University, Jerusalem 91904, Israel. kobics@cs.huji.ac.il
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 EachMovie data set for collaborative filtering. In the experiments we performed, our algorithms outperform online algorithms for regression and classification applied to ranking.
Related Concept Videos
Coordinates and Map Projections
Fischer Projections
Position Vectors
For instance, we want to locate a point P(x, y, z) relative to the origin of coordinates O. In that case, we can define a position...
Methods of Obtaining Topography
Newman Projections
The organic molecules rotate across the single bonds leading to numerous temporary three-dimensional structures of varying energy known as conformers.
Position and Displacement Vectors
Further, several important kinds of...