Supervised Rank Prediction Task
(Redirected from Problems of ordinal regression)
Jump to navigation
Jump to search
A Supervised Rank Prediction Task is a data-driven rank prediction task that is a supervised ordinal prediction task.
- AKA: Learing-to-Rank (LTR).
- Context:
- It can be solved by a Supervised Rank Prediction System (that implements a supervised rank prediction algorithm).
- Example(s):
- predict the rank of ads that will optimize clickthrough rate.
- …
- Counter-Example(s):
- See: Supervised IR.
References
2022
- (Li, 2022) ⇒ Hang Li. (2022). “Learning to Rank for Information Retrieval and Natural Language Processing.” Springer Nature. ISBN:9783031021558
2009
- (Liu, 2009) ⇒ Tie-Yan Liu. (2009). “Learning to Rank for Information Retrieval.” Foundations and Trends ® in Information Retrieval, 3(3).
1999
- (Herbrich et al., 1999) ⇒ Ralf Herbrich, Thore Graepel, and Klaus Obermayer. (1999). “Support Vector Learning for Ordinal Regression.” In: Proceedings of the Ninth International Conference on Artificial Neural Networks.
- QUOTE: Problems of ordinal regression arise in many fields, e.g., in information retrieval (Herbrich et al. 1998), in econometric models (Tangian and Gruber 1995), and in classical statistics (McCullagh 1980; Anderson 1984). They can be related to the standard machine learning paradigm as follows: ...