Affiliation:
1. School of Computer Science and Engineering, Hebrew University, Jerusalem 91904, Israel,
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.
Subject
Cognitive Neuroscience,Arts and Humanities (miscellaneous)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Detection of Skin Cancer using Convolutional Neural Network;International Journal of Advanced Research in Science, Communication and Technology;2022-05-20
2. Companion Losses for Ordinal Regression;Lecture Notes in Computer Science;2022
3. OCEAn: Ordinal classification with an ensemble approach;Information Sciences;2021-11
4. Online learning: A comprehensive survey;Neurocomputing;2021-10
5. Scalable Kernel Ordinal Regression via Doubly Stochastic Gradients;IEEE Transactions on Neural Networks and Learning Systems;2021-08