{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:10:08Z","timestamp":1739308208309,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037832"},{"type":"electronic","value":"9783642037849"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03784-9_34","type":"book-chapter","created":{"date-parts":[[2009,8,21]],"date-time":"2009-08-21T14:47:42Z","timestamp":1250866062000},"page":"344-352","source":"Crossref","is-referenced-by-count":10,"title":["Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Bachrach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Herbrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_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"},{"key":"34_CR2","unstructured":"Bachrach, Y., Porat, E., Rosenschein, J.S.: Sketching techniques for collaborative filtering. In: IJCAI 2009, Pasadena, California (July 2009) (to appear)"},{"key":"34_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3973-2","volume-title":"Elementary Probability Theory with Stochastic Processes","author":"K.L. Chung","year":"1974","unstructured":"Chung, K.L.: Elementary Probability Theory with Stochastic Processes. Springer, Heidelberg (1974)"},{"issue":"1","key":"34_CR4","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."},{"key":"34_CR5","volume-title":"VLDB: International Conference on Very Large Data Bases","author":"A. Gionis","year":"1999","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB: International Conference on Very Large Data Bases, Morgan Kaufmann Publishers, San Francisco (1999)"},{"issue":"301","key":"34_CR6","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":"34_CR7","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"},{"key":"34_CR8","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":"34_CR9","first-page":"175","volume-title":"Proceedings of the ACM 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 Conference on Computer Supported Cooperative Work, pp. 175\u2013186. ACM Press, New York (1994)"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Salakhutdinov, R., Hinton, G.: Semantic hashing. In: International Journal of Approximate Reasoning (December 2008)","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"34_CR11","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"},{"key":"34_CR12","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-03784-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:28:02Z","timestamp":1739305682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03784-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037832","9783642037849"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03784-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}