{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:02Z","timestamp":1725488462486},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423430"},{"type":"electronic","value":"9783540445814"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44581-1_34","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:13:49Z","timestamp":1186726429000},"page":"517-528","source":"Crossref","is-referenced-by-count":0,"title":["A Theoretical Analysis of Query Selection for Collaborative Filtering"],"prefix":"10.1007","author":[{"given":"Wee Sun","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip M.","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,13]]},"reference":[{"key":"34_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and concept learning. Machine Learning, 2:319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1007311411259","volume":"28","author":"D. Angluin","year":"1997","unstructured":"D. Angluin, M. Krikis, R.H. Sloan, and G. Tur\u00e1n. Malicious omissions and errors in answers to membership queries. Machine Learning, 28:211\u2013255, 1997.","journal-title":"Machine Learning"},{"key":"34_CR3","unstructured":"S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. Proc. 5th ACM-SIAM Sympos. Discrete Algorithms, pages 573\u2013582, 1994."},{"key":"34_CR4","unstructured":"J.S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative ltering. Proceedings of the Fourteenth Conference on Uncertainty in Articial Intelligence, pages 43\u201352, 1998."},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. Proceedings of the 30th ACM Symposium on the Theory of Computing, pages 604\u2013613, 1998.","DOI":"10.1145\/276698.276876"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256\u2013278, 1974.","journal-title":"Journal of Computer and System Sciences"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. Proceedings of the 30th ACM Symposium on the Theory of Computing, pages 614\u2013623, 1998.","DOI":"10.1145\/276698.276877"},{"key":"34_CR8","unstructured":"Atsuyoshi Nakamura and Naoki Abe. Collaborative filtering using weighted majority prediction algorithms. In Proceedings of the Fifteenth International Conference on Machine Learning, 1998."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. Grouplens: An open architecture for collaborative filtering of netnews. In Proceedings of the ACM 1994 Conference on Computer Supported Cooperative Work, 1994.","DOI":"10.1145\/192844.192905"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/245108.245121","volume":"40","author":"P. Resnick","year":"1997","unstructured":"P. Resnick and H.R. Varian. Recommender systems. Communications of the ACM, 40:56\u201358, 1997.","journal-title":"Communications of the ACM"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"H.S. Seung, M. Opper, and H. Sompolinsky. Query by committee. Proceedings of the 1992 Workshop on Computational Learning Theory, pages 287\u2013294, 1992.","DOI":"10.1145\/130385.130417"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44581-1_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:11:14Z","timestamp":1556734274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44581-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423430","9783540445814"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44581-1_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}