A Theoretical Analysis of Query Selection for Collaborative Filtering

A Theoretical Analysis of Query Selection for Collaborative Filtering (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Wee Sun Lee , Philip M. Long

Venue:	Machine Learning
Citations:	8 - 1 self

BibTeX

@INPROCEEDINGS{Lee03atheoretical,
    author = {Wee Sun Lee and Philip M. Long},
    title = {A Theoretical Analysis of Query Selection for Collaborative Filtering},
    booktitle = {Machine Learning},
    year = {2003},
    pages = {2003}
}

Bookmark

OpenURL

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.

Citations

875	Grouplens: An open architecture for collaborative filtering of netnews - Resnick, Iacovou, et al. - 1994
803	H.R.: Recommender systems - Resnick, Varian - 1997
778	Em-pirical Analysis of Predictive Algorithms for Col-laborative Filtering - Breese, Heckerman, et al. - 1998
634	An optimal algorithm for approximate nearest neighbor searching in fixed dimensions - Arya, Mount, et al. - 1994
583	Queries and concept learning - Angluin - 1988
577	Approximation algorithms for combinatorial problems - Johnson - 1974
533	Approximate nearest neighbors: towards removing the curse of dimensionality - Indyk, Motwani - 1998
518	A threshold of ln n for approximating set cover - Feige
243	Smopolinsky H: Query by committee - Seung, Opper - 1992
173	Efficient search for approximate nearest neighbor in high dimensional spaces - Kushilevitz, Ostrovsky, et al. - 1998
147	Constructing optimal binary decision trees is NP-complete - l, Rivest - 1976
72	Oracles and queries that are sufficient for exact learning - Bshouty, Cleve, et al. - 1996
57	How many queries are needed to learn - Hellerstein, Pillaipakkamnatt, et al. - 1996
50	Queries revisited - Angluin - 2001
44	Generalized teaching dimensions and the query complexity of learning - Hegedűs - 1995
43	Collaborative filtering using weighted majority prediction algorithms - Nakamura, Abe - 1998
25	S.: Decision trees for geometric models - Arkin, Meijer, et al. - 1998
15	Oracles and queries that are sucient for exact learning - Bshouty, Cleve, et al. - 1996
15	Ecient search for approximate nearest neighbors in high dimensional spaces - Kushilevitz, Ostrovsky, et al. - 1998
13	Malicious omissions and errors in answers to membership queries - Angluin, Krikis, et al. - 1997
12	Quantum versus classical learnability - Servedio, Gortler - 2001
1	Collaborative £ltering using weighted majority pr ediction algorithms - Nakamura, Abe - 1998