Estimating Probabilities in Recommendation Systems
Abstract
Modeling ranked data is an essential component in a number of important applications including recommendation systems and web-search. In many cases, judges omit preference among unobserved items and between unobserved and observed items. This case of analyzing incomplete rankings is very important from a practical perspective and yet has not been fully studied due to considerable computational difficulties. We show how to avoid such computational difficulties and efficiently construct a non-parametric model for rankings with missing items. We demonstrate our approach and show how it applies in the context of collaborative filtering.
Cite
Text
Sun et al. "Estimating Probabilities in Recommendation Systems." Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011.Markdown
[Sun et al. "Estimating Probabilities in Recommendation Systems." Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011.](https://mlanthology.org/aistats/2011/sun2011aistats-estimating/)BibTeX
@inproceedings{sun2011aistats-estimating,
title = {{Estimating Probabilities in Recommendation Systems}},
author = {Sun, Mingxuan and Lebanon, Guy and Kidwell, Paul},
booktitle = {Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics},
year = {2011},
pages = {734-742},
volume = {15},
url = {https://mlanthology.org/aistats/2011/sun2011aistats-estimating/}
}