{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T17:05:29Z","timestamp":1783098329443,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642163203","type":"print"},{"value":"9783642163210","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16321-0_3","type":"book-chapter","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T14:51:32Z","timestamp":1286290292000},"page":"25-36","source":"Crossref","is-referenced-by-count":4,"title":["Fingerprinting Ratings for Collaborative Filtering \u2014 Theoretical and Empirical Analysis"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Bachrach","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ralf","family":"Herbrich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D.: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. JCSS\u00a066 (2003)","DOI":"10.1016\/S0022-0000(03)00025-4"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A. Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM\u00a051(1), 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Betzler, N., Faliszewski, P.: Probabilistic possible winner determination. AAAI\u00a038 (2010)","DOI":"10.1609\/aaai.v24i1.7609"},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10458-009-9078-9","volume":"20","author":"Y. Bachrach","year":"2010","unstructured":"Bachrach, Y., Markakis, E., Resnick, E., Procaccia, A.D., Rosenschein, J.S., Saberi, A.: Approximating power indices: theoretical and empirical analysis. Autonomous Agents and Multi-Agent Systems\u00a020(2), 105\u2013122 (2010)","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"issue":"2","key":"3_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10458-008-9073-6","volume":"19","author":"Y. Bachrach","year":"2009","unstructured":"Bachrach, Y., Parnes, A., Procaccia, A.D., Rosenschein, J.S.: Gossip-based aggregation of trust in decentralized reputation systems. Autonomous Agents and Multi-Agent Systems\u00a019(2), 153\u2013172 (2009)","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Herbrich, R., Porat, E.: Sketching algorithms for approximating rank correlations in collaborative filtering systems. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) SPIRE 2009. LNCS, vol.\u00a05721, pp. 344\u2013352. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-03784-9_34"},{"key":"3_CR7","unstructured":"Bachrach, Y., Porat, E., Rosenschein, J.S.: Sketching techniques for collaborative filtering. In: IJCAI 2009, Pasadena, California (July 2009)"},{"issue":"2","key":"3_CR8","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 Explor. Newsl.\u00a09(2), 75\u201379 (2007)","journal-title":"SIGKDD Explor. Newsl."},{"key":"3_CR9","first-page":"43","volume-title":"Proceedings of UAI 1998","author":"J.S. Breese","year":"1998","unstructured":"Breese, J.S., Heckerman, D., Kadie, C.: Empirical analysis of predictive algorithms for collaborative filtering. In: Proceedings of UAI 1998, pp. 43\u201352. Morgan Kaufmann, San Francisco (1998)"},{"issue":"3","key":"3_CR10","first-page":"630","volume":"60","author":"A.Z. Broder","year":"2000","unstructured":"Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations. JCSS\u00a060(3), 630\u2013659 (2000)","journal-title":"JCSS"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-75520-3_15","volume-title":"Algorithms \u2013 ESA 2007","author":"R. Clifford","year":"2007","unstructured":"Clifford, R., Efremenko, K., Porat, E., Rothschild, A.: K-mismatch with don\u2019t cares. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 151\u2013162. Springer, Heidelberg (2007)"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/TKDE.2003.1198388","volume":"15","author":"G. Cormode","year":"2003","unstructured":"Cormode, G., Datar, M., Indyk, P., Muthukrishnan, S.: Comparing data streams using Hamming norms. IEEE Trans. Knowl. Data Eng.\u00a015(3), 529\u2013540 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/S0097539799361701","volume":"32","author":"J. Feigenbaum","year":"2002","unstructured":"Feigenbaum, J., Kannan, S., Strauss, M., Viswanathan, M.: An approximate L1-difference algorithm for massive data streams. SIAM J. Comput\u00a032(1), 131\u2013151 (2002)","journal-title":"SIAM J. Comput"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.tcs.2005.08.031","volume":"349","author":"E. Hemaspaandra","year":"2005","unstructured":"Hemaspaandra, E., Spakowski, H., Vogel, J.: The complexity of Kemeny elections. Theoretical Computer Science\u00a0349(3), 382\u2013391 (2005)","journal-title":"Theoretical Computer Science"},{"key":"3_CR15","unstructured":"Higgins, J.J.: An introduction to modern nonparametric statistics. Thomson Learning (2004)"},{"issue":"301","key":"3_CR16","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association\u00a058(301), 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1006\/jagm.2000.1131","volume":"38","author":"P. Indyk","year":"2001","unstructured":"Indyk, P.: A small approximately min-wise independent family of hash functions. Journal of Algorithms\u00a038(1), 84\u201390 (2001)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"3_CR18","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/j.dss.2005.05.019","volume":"43","author":"A. Jusang","year":"2007","unstructured":"Jusang, A., Ismail, R., Boyd, C.: A survey of trust and reputation systems for online service provision. Decision Support Systems\u00a043(2), 618\u2013644 (2007)","journal-title":"Decision Support Systems"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/biomet\/30.1-2.81","volume":"30","author":"M.G. Kendall","year":"1938","unstructured":"Kendall, M.G.: A new measure of rank correlation. Biometrika\u00a030, 81\u201393 (1938)","journal-title":"Biometrika"},{"key":"3_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/192844.192905","volume-title":"Proceedings of the ACM 1994 Conference on Computer Supported Cooperative Work","author":"P. Resnick","year":"1994","unstructured":"Resnick, P., Iacovou, N., Suchak, M., Bergstorm, P., Riedl, J.: Grouplens: An open architecture for collaborative filtering of netnews. In: Proceedings of the ACM 1994 Conference on Computer Supported Cooperative Work, Chapel Hill, North Carolina, pp. 175\u2013186. ACM, New York (1994)"},{"key":"3_CR21","unstructured":"Rivest, R.L.: The md5 message-digest algorithm (rfc 1321)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Shardan, U., Maes, P.: Social information filtering: Algorithms for automating \u201cword of mouth\u201d. In: ACM CHI 1995, vol.\u00a01, pp. 210\u2013217 (1995)","DOI":"10.1145\/223904.223931"},{"issue":"3-4","key":"3_CR23","doi-asserted-by":"publisher","first-page":"441","DOI":"10.2307\/1422689","volume":"100","author":"C. Spearman","year":"1987","unstructured":"Spearman, C.: The proof and measurement of association between two things 1904. The American Journal of Psychology\u00a0100(3-4), 441\u2013471 (1987)","journal-title":"The American Journal of Psychology"},{"key":"3_CR24","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: Advances in Neural Processing Systems (2008)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16321-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T06:57:49Z","timestamp":1740553069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16321-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163203","9783642163210"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16321-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}