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.
CITATION STYLE
Lee, W. S., & Long, P. M. (2001). A theoretical analysis of query selection for collaborative filtering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2111, pp. 517–528). Springer Verlag. https://doi.org/10.1007/3-540-44581-1_34
Mendeley helps you to discover research relevant for your work.