{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T12:10:03Z","timestamp":1752149403877,"version":"3.41.2"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1023\/a:1022961719072","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:16:51Z","timestamp":1049739411000},"page":"283-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Theoretical Analysis of Query Selection for Collaborative Filtering"],"prefix":"10.1007","volume":"51","author":[{"given":"Sanjoy","family":"Dasgupta","sequence":"first","affiliation":[]},{"given":"Wee Sun","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Philip M.","family":"Long","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5120304_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988). Queries and concept learning. Machine Learning, 2, 319\u2013342.","journal-title":"Machine Learning"},{"key":"5120304_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D. (2001). Queries revisited. In Proceedings of the Twelfth International Conference on Algorithmic Learning Theory (pp. 12\u201331).","DOI":"10.1007\/3-540-45583-3_3"},{"key":"5120304_CR3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1007311411259","volume":"28","author":"D. Angluin","year":"1997","unstructured":"Angluin, D., Krikis, M., Sloan, R. H., & Tur\u00e1n, G. (1997). Malicious omissions and errors in answers to membership queries. Machine Learning, 28, 211\u2013255.","journal-title":"Machine Learning"},{"issue":"3","key":"5120304_CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1142\/S0218195998000175","volume":"8","author":"E. M. Arkin","year":"1998","unstructured":"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\u2013364.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"5120304_CR5","unstructured":"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\u2013582)."},{"key":"5120304_CR6","unstructured":"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\u201352)."},{"key":"5120304_CR7","doi-asserted-by":"crossref","unstructured":"Bshouty, N. H., Cleve, R., Gavalda, R., Kannan, S., & Tamon, C. (1996). Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences, 52:3.","DOI":"10.1006\/jcss.1996.0032"},{"issue":"4","key":"5120304_CR8","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U. (1998). A threshold of ln n for approximating Set Cover. Journal of the ACM, 45:4, 634\u2013652.","journal-title":"Journal of the ACM"},{"key":"5120304_CR9","doi-asserted-by":"crossref","unstructured":"Gortler, S., & Servedio, R. (2001). Quantum versus classical learnability. In Sixteenth Conference on Computational Complexity (CCC), (pp. 138\u2013148).","DOI":"10.1109\/CCC.2001.933881"},{"key":"5120304_CR10","doi-asserted-by":"crossref","unstructured":"Hegedus, T. (1995). Generalized teaching dimensions and the query complexity of learning. In Proceedings of the 1995 Conference on Computational Learning Theory (pp. 108\u2013117).","DOI":"10.1145\/225298.225311"},{"issue":"5","key":"5120304_CR11","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1145\/234752.234755","volume":"43","author":"L. Hellerstein","year":"1996","unstructured":"Hellerstein, L., Raghavan, V., Pillaipakkamnatt, K., & Wilkins, D. (1996). How many queries are needed to learn? Journal of the ACM, 43:5, 840\u2013862.","journal-title":"Journal of the ACM"},{"issue":"1","key":"5120304_CR12","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L. Hyafil","year":"1976","unstructured":"Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:1, 15\u201317.","journal-title":"Information Processing Letters"},{"key":"5120304_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013613).","DOI":"10.1145\/276698.276876"},{"key":"5120304_CR14","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. S. Johnson","year":"1974","unstructured":"Johnson, D. S. (1974). Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9, 256\u2013278.","journal-title":"Journal of Computer and System Sciences"},{"key":"5120304_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013623).","DOI":"10.1145\/276698.276877"},{"key":"5120304_CR16","unstructured":"Nakamura, A., & Abe, N. (1998). Collaborative filtering using weighted majority prediction algorithms. In Proceedings of the Fifteenth International Conference on Machine Learning."},{"key":"5120304_CR17","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1145\/192844.192905"},{"key":"5120304_CR18","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/245108.245121","volume":"40","author":"P. Resnick","year":"1997","unstructured":"Resnick, P., & Varian, H. R. (1997). Recommender systems. Communications of the ACM, 40, 56\u201358.","journal-title":"Communications of the ACM"},{"key":"5120304_CR19","doi-asserted-by":"crossref","unstructured":"Seung, H. S., Opper, M., & Sompolinsky, H. (1992). Query by committee. In Proceedings of the 1992 Workshop on Computational Learning Theory (pp. 287\u2013294).","DOI":"10.1145\/130385.130417"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022961719072.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022961719072\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022961719072.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:34:14Z","timestamp":1752147254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022961719072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["5120304"],"URL":"https:\/\/doi.org\/10.1023\/a:1022961719072","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2003,6]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}