A Theoretical Analysis of Query Selection for Collaborative Filtering
Lists
Only you see this
Abstract
We consider the problem of determining which of a set of experts has tastes most similar to a given user by asking the user questions about his likes and dislikes. We describe a simple and fast algorithm for a theoretical model of this problem with a provable approximation guarantee, and prove that solving the problem exactly is NP-Hard.
BibTeX
@inproceedings{lee2001theoretical,
author = {Wee Sun Lee and Philip M. Long},
title = {{A Theoretical Analysis of Query Selection for Collaborative Filtering}},
booktitle = {Conference on Learning Theory},
year = {2001},
url = {https://openreview.net/forum?id=_h6tyHHK5wH},
}Loading related content...