{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:49:23Z","timestamp":1725738563355},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_41","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"459-471","source":"Crossref","is-referenced-by-count":11,"title":["Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints"],"prefix":"10.1007","author":[{"given":"Yoram","family":"Bachrach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C.: Data streams: models and algorithms. Springer-Verlag New York Inc. (2007)","DOI":"10.1007\/978-0-387-47534-9"},{"issue":"1","key":"41_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N. Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The Space Complexity of Approximating the Frequency Moments. J. Computer and System Sciences\u00a058(1), 137\u2013147 (1999)","journal-title":"J. Computer and System Sciences"},{"key":"41_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-16321-0_3","volume-title":"String Processing and Information Retrieval","author":"Y. Bachrach","year":"2010","unstructured":"Bachrach, Y., Herbrich, R.: Fingerprinting Ratings for Collaborative Filtering \u2014 Theoretical and Empirical Analysis. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 25\u201336. Springer, Heidelberg (2010)"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-03784-9_34","volume-title":"String Processing and Information Retrieval","author":"Y. Bachrach","year":"2009","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)"},{"key":"41_CR5","unstructured":"Bachrach, Y., Porat, E., Rosenschein, J.S.: Sketching techniques for collaborative filtering. In: IJCAI, Pasadena, California (July 2009)"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Bennett, J., Lanning, S.: The netflix prize. In: KDD Cup and Workshop (2007)","DOI":"10.1145\/1345448.1345459"},{"key":"41_CR7","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. Sequences (1998)"},{"issue":"3","key":"41_CR8","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1006\/jcss.1999.1690","volume":"60","author":"A.Z. Broder","year":"2000","unstructured":"Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations. Journal of Computer and System Sciences\u00a060(3), 630\u2013659 (2000)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"41_CR9","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G. Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms\u00a055(1), 58\u201375 (2005)","journal-title":"Journal of Algorithms"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S., Rozenbaum, I.: Summarizing and mining inverse distributions on data streams via dynamic inverse sampling. In: VLDB (2005)","DOI":"10.1137\/1.9781611972757.5"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Das, A.S., Datar, M., Garg, A., Rajaram, S.: Google news personalization: scalable online collaborative filtering. In: WWW. ACM (2007)","DOI":"10.1145\/1242572.1242610"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Dasgupta, A., Kumar, R., Sarlos, T.: Fast locality-sensitive hashing. In: SIGKDD (2011)","DOI":"10.1145\/2020408.2020578"},{"key":"41_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-45749-6_31","volume-title":"Algorithms - ESA 2002","author":"M. Datar","year":"2002","unstructured":"Datar, M., Muthukrishnan, S.: Estimating rarity and similarity over data stream windows. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 323\u2013335. Springer, Heidelberg (2002)"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Feigenblat, G., Shiftan, A., Porat, E.: Exponential time improvement for min-wise based algorithms. In: SODA (2011)","DOI":"10.1137\/1.9781611973082.5"},{"issue":"301","key":"41_CR15","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":"41_CR16","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":"3","key":"41_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/1147954.1147955","volume":"53","author":"P. Indyk","year":"2006","unstructured":"Indyk, P.: Stable distributions, pseudorandom generators, embeddings, and data stream computation. Journal of the ACM (JACM)\u00a053(3), 323 (2006)","journal-title":"Journal of the ACM (JACM)"},{"key":"41_CR18","doi-asserted-by":"crossref","unstructured":"Kane, D.M., Nelson, J., Porat, E., Woodruff, D.P.: Fast moment estimation in data streams in optimal space. In: STOC (2011)","DOI":"10.1145\/1993636.1993735"},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Kane, D.M., Nelson, J., Woodruff, D.P.: An optimal algorithm for the distinct elements problem. In: PODS, pp. 41\u201352. ACM (2010)","DOI":"10.1145\/1807085.1807094"},{"issue":"1","key":"41_CR20","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"R.M. Karp","year":"2003","unstructured":"Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems (TODS)\u00a028(1), 51\u201355 (2003)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"41_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11841036_42","volume-title":"Algorithms \u2013 ESA 2006","author":"A. Kirsch","year":"2006","unstructured":"Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: a better Bloom filter. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 456\u2013467. Springer, Heidelberg (2006)"},{"key":"41_CR22","doi-asserted-by":"crossref","unstructured":"Li, P., Koenig, C.: b-Bit minwise hashing. In: WWW (2010)","DOI":"10.1145\/1772690.1772759"},{"key":"41_CR23","doi-asserted-by":"crossref","unstructured":"Mulmuley, K.: Randomized geometric algorithms and pseudorandom generators. Algorithmica (1996)","DOI":"10.1007\/BF01940875"},{"key":"41_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/978-3-642-14165-2_60","volume-title":"Automata, Languages and Programming","author":"M. P\u01cetra\u015fcu","year":"2010","unstructured":"P\u01cetra\u015fcu, M., Thorup, M.: On the k-Independence Required by Linear Probing and Minwise Independence. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 715\u2013726. Springer, Heidelberg (2010)"},{"issue":"2","key":"41_CR25","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/050643672","volume":"37","author":"A. Pavan","year":"2008","unstructured":"Pavan, A., Tirthapura, S.: Range-efficient counting of distinct elements in a massive data stream. SIAM Journal on Computing\u00a037(2), 359\u2013379 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR26","doi-asserted-by":"crossref","unstructured":"Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., Riedl, J.: Grouplens: an open architecture for collaborative filtering of netnews. In: Computer Supported Cooperative Work (1994)","DOI":"10.1145\/192844.192905"},{"key":"41_CR27","doi-asserted-by":"crossref","unstructured":"Sarwar, B., Karypis, G., Konstan, J., Reidl, J.: Item-based collaborative filtering recommendation algorithms. In: WWW (2001)","DOI":"10.1145\/371920.372071"},{"key":"41_CR28","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1155\/2009\/421425","volume":"2009","author":"X. Su","year":"2009","unstructured":"Su, X., Khoshgoftaar, T.M.: A survey of collaborative filtering techniques. Advances in Artificial Intelligence\u00a02009, 4 (2009)","journal-title":"Advances in Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T23:11:04Z","timestamp":1563318664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}