{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:54:19Z","timestamp":1780674859635,"version":"3.54.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319252575","type":"print"},{"value":"9783319252582","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25258-2_30","type":"book-chapter","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T03:10:18Z","timestamp":1445224218000},"page":"429-443","source":"Crossref","is-referenced-by-count":2,"title":["Comparison-Based Interactive Collaborative Filtering"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Carmel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boaz","family":"Patt-Shamir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"key":"30_CR1","unstructured":"Ailon, N.: Active learning ranking from pairwise preferences with almost optimal query complexity. In: Proc. NIPS, pp. 810\u2013818 (2011)"},{"issue":"5","key":"30_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N. Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM\u00a055(5), 23 (2008)","journal-title":"J. ACM"},{"issue":"1","key":"30_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N. Alon","year":"2006","unstructured":"Alon, N.: Ranking tournaments. SIAM Journal on Discrete Mathematics\u00a020(1), 137\u2013142 (2006)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00224-008-9100-7","volume":"45","author":"N. Alon","year":"2009","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Patt-Shamir, B.: Tell me who I am: an interactive recommendation system. Theory of Computing Systems\u00a045(2), 261\u2013279 (2009)","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00224-007-9016-7","volume":"42","author":"B. Awerbuch","year":"2008","unstructured":"Awerbuch, B., Azar, Y., Lotker, Z., Patt-Shamir, B., Tuttle, M.R.: Collaborate with strangers to find own preferences. Theory of Computing Systems\u00a042(1), 27\u201341 (2008)","journal-title":"Theory of Computing Systems"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Azar, Y., Nisgav, A., Patt-Shamir, B.: Recommender systems with non-binary grades. In: Proc. 23rd SPAA, pp. 245\u2013252. ACM (2011)","DOI":"10.1145\/1989493.1989528"},{"issue":"2","key":"30_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/1345448.1345465","volume":"9","author":"R.M. Bell","year":"2007","unstructured":"Bell, R.M., Koren, Y.: Lessons from the netflix prize challenge. SIGKDD Explorations\u00a09(2), 75\u201379 (2007)","journal-title":"SIGKDD Explorations"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Carterette, B., Bennett, P.N., Chickering, D.M., Dumais, S.T.: Here or there. In: Proc. 30th European Conf. on Advances in Information Retrieval, pp. 16\u201327 (2008)","DOI":"10.1007\/978-3-540-78646-7_5"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-31454-4_6","volume-title":"User Modeling, Adaptation, and Personalization","author":"M.S. Desarkar","year":"2012","unstructured":"Desarkar, M.S., Saxena, R., Sarkar, S.: Preference relation based matrix factorization for recommender systems. In: Masthoff, J., Mobasher, B., Desmarais, M.C., Nkambou, R. (eds.) UMAP 2012. LNCS, vol.\u00a07379, pp. 63\u201375. Springer, Heidelberg (2012)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Drineas, P., Kerenidis, I., Raghavan, P.: Competitive recommendation systems. In: Proc. 34th Ann. ACM Symp. on Theory of Computing, pp. 82\u201390. ACM (2002)","DOI":"10.1145\/509907.509922"},{"issue":"2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1011419012209","volume":"4","author":"K. Goldberg","year":"2001","unstructured":"Goldberg, K., Roeder, T., Gupta, D., Perkins, C.: Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval\u00a04(2), 133\u2013151 (2001)","journal-title":"Information Retrieval"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Jones, N., Brun, A., Boyer, A.: Comparisons instead of ratings: Towards more stable preferences. In: Proc. Int. Conf. on Web Intelligence and Intelligent Agent Technology, pp. 451\u2013456. IEEE Computer Society (2011)","DOI":"10.1109\/WI-IAT.2011.13"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: Proc. 39th Ann. ACM Symp. on Theory of Computing, pp. 95\u2013103. ACM (2007)","DOI":"10.1145\/1250790.1250806"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Loepp, B., Hussein, T., Ziegler, J.: Choice-based preference elicitation for collaborative filtering recommender systems. In: Proc. 32nd Ann. ACM Conf. on Human Factors in Computing Systems, pp. 3085\u20133094 (2014)","DOI":"10.1145\/2556288.2557069"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-642-25591-5_44","volume-title":"Algorithms and Computation","author":"A. Nisgav","year":"2011","unstructured":"Nisgav, A., Patt-Shamir, B.: Improved collaborative filtering. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol.\u00a07074, pp. 425\u2013434. Springer, Heidelberg (2011)"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Analysis of recommendation algorithms for e-commerce. In: Proc. 2nd ACM Conf. on Electronic Commerce, pp. 158\u2013167. ACM (2000)","DOI":"10.1145\/352871.352887"},{"issue":"3","key":"30_CR17","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L.G. Valiant","year":"1975","unstructured":"Valiant, L.G.: Parallelism in comparison problems. SIAM J. on Computing\u00a04(3), 348\u2013355 (1975)","journal-title":"SIAM J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25258-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T03:54:27Z","timestamp":1559274867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25258-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319252575","9783319252582"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25258-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}