A theoretical analysis of query selection for collaborative filtering

Machine Learning

Volumn 51, Issue 3, 2003, Pages 283-298

  Dasgupta, Sanjoy ^a   Lee, Wee Sun ^b   Long, Philip M ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c GENOME INSTITUTE OF SINGAPORE   (Singapore)

Author keywords

Approximation algorithms; Collaborative filtering; Inapproximability; Membership queries; Recommender systems

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; LEARNING SYSTEMS; MATRIX ALGEBRA; OPTIMIZATION; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHMS; COLLABORATIVE FILTERING; INAPPROXIMABILITY; MEMBERSHIP QUERIES; QUERY SELECTION; RECOMMENDER SYSTEMS;

ALGORITHMS;

EID: 0038290328     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022961719072     Document Type: Article

References (19)

1. Angluin, D. (1988). Queries and concept learning. Machine Learning, 2, 319-342.
2. Angluin, D. (2001). Queries revisited. In Proceedings of the Twelfth International Conference on Algorithmic Learning Theory (pp. 12-31).
3. Angluin, D., Krikis, M., Sloan, R. H., & Turán, G. (1997). Malicious omissions and errors in answers to membership queries. Machine Learning, 28, 211-255.
4. Arkin, E. M., Meijer, H., Mitchell, J. S. B., Rappaport, D., & Skiena, S. (1998). Decision trees for geometric models. International Journal of Computational Geometry and Applications, 8:3, 343-364.
5. Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. (1994). An optimal algorithm for approximate nearest neighbor searching. In Proc. 5th ACM-SIAM Sympos. Discrete Algorithms (pp. 573-582).
6. Breese, J., Heckerman, D., & Kadie, C. (1998). Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (pp. 43-52).
7. Bshouty, N. H., Cleve, R., Gavalda, R., Kannan, S., & Tamon, C. (1998). Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences, 52:3.
8. Feige, U. (1998). A threshold of ln n for approximating Set Cover. Journal of the ACM, 45:4, 634-652.
9. Gortler, S., & Servedio, R. (2001). Quantum versus classical learnability. In Sixteenth Conference on Computational Complexity (CCC), (pp. 138-148).
10. Hegedus, T. (1995). Generalized teaching dimensions and the query complexity of learning. In Proceedings of the 1995 Conference on Computational Learning Theory (pp. 108-117).
11. Hellerstein, L., Raghavan, V., Pillaipakkamatt, K., & Wilkins, D. (1996). How many queries are needed to learn? Journal of the ACM, 43:5, 840-862.
12. Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:1, 15-17.
13. Indyk, P., & Motwani, R. (1998). Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the 30th ACM Symposium on the Theory of Computing (pp. 604-613).
14. Johnson, D. S. (1974). Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9, 256-278.
15. Kushilevitz, E., Ostrovsky, R., & Rabani, Y. (1998). Efficient search for approximate nearest neighbor in high dimensional spaces. In Proceedings of the 30th ACM Symposium on the Theory of Computing (pp. 614-623).
16. Nakamura, A., & Abe, N. (1998). Collaborative filtering using weighted majority prediction algorithms. In Proceedings of the Fifteenth International Conference on Machine Learning.
17. Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., & Riedl, J. (1994). Grouplens: An open architecture for collaborative filtering of netnews. In Proceedings of the ACM 1994 Conference on Computer Supported Cooperative Work.
18. Resnick, P., & Varian, H. R. (1997). Recommender systems. Communications of the ACM, 40, 56-58.
19. Seung, H. S., Opper, M., & Sompolinsky, H. (1992). Query by committee. In Proceedings of the 1992 Workshop on Computational Learning Theory (pp. 287-294).