Fingerprints for highly similar streams

Information and Computation

Volumn 244, Issue , 2015, Pages 113-121

  Bachrach, Yoram ^a   Porat, Ely ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SYSTEMS;

DEGREE OF SIMILARITY; MULTIPLICATIVE FACTORS; NORM ESTIMATIONS; SAMPLING TECHNIQUE; TWO-STREAM;

COMPUTATIONAL METHODS;

EID: 84941361489     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2015.06.001     Document Type: Article

References (38)

1. N. Alon, Y. Matias, and M. Szegedy The space complexity of approximating the frequency moments J. Comput. Syst. Sci. 58 1 1999 137 147
2. A. Andoni, A. Goldberger, A. McGregor, and E. Porat Homomorphic fingerprints under misalignments: sketching edit and shift distances Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing 2013 ACM 931 940
3. Y. Bachrach, S. Ceppi, I.A. Kash, P. Key, F. Radlinski, E. Porat, M. Armstrong, and V. Sharma Building a personalized tourist attraction recommender system using crowdsourcing Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems International Foundation for Autonomous Agents and Multiagent Systems 2014 1631 1632
4. Y. Bachrach, Y. Finkelstein, R. Gilad-Bachrach, L. Katzir, N. Koenigstein, N. Nice, and U. Paquet Speeding up the Xbox recommender system using a Euclidean transformation for inner-product spaces Proceedings of the 8th ACM Conference on Recommender Systems 2014
5. Y. Bachrach, T. Graepel, P. Kohli, M. Kosinski, and D. Stillwell Your digital image: factors behind demographic and psychometric predictions from social network profiles Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems International Foundation for Autonomous Agents and Multiagent Systems 2014 1649 1650
6. Y. Bachrach, and R. Herbrich Fingerprinting ratings for collaborative filtering - theoretical and empirical analysis String Processing and Information Retrieval 2010 Springer 25 36
7. Y. Bachrach, R. Herbrich, and E. Porat Sketching algorithms for approximating rank correlations in collaborative filtering systems SPIRE 2009
8. Y. Bachrach, M. Kosinski, T. Graepel, P. Kohli, and D. Stillwell Personality and patterns of Facebook usage Proceedings of the 3rd Annual ACM Web Science Conference 2012 ACM 24 32
9. Y. Bachrach, E. Porat, Fast pseudo-random fingerprints, 2010.
10. Y. Bachrach, and E. Porat Sketching for big data recommender systems using fast pseudo-random fingerprints Automata, Languages, and Programming 2013 Springer 459 471
11. Y. Bachrach, E. Porat, and J.S. Rosenschein Sketching techniques for collaborative filtering IJCAI Pasadena, California July 2009
12. A. Broder, M. Charikar, A. Frieze, and M. Mitzenmacher Min-wise independent permutations J. Comput. Syst. Sci. 60 3 2000 630 659
13. M. Charikar, K. Chen, and M. Farach-Colton Finding frequent items in data streams Autom. Lang. Program. 2002 784
14. R. Clifford, M. Jalsenius, E. Porat, and B. Sach Pattern matching in multiple streams Combinatorial Pattern Matching 2012 Springer 97 109
15. E. Cohen, N. Duffield, H. Kaplan, C. Lund, and M. Thorup Sketching unaggregated data streams for subpopulation-size queries PODS 2007 ACM
16. E. Cohen, and H. Kaplan Summarizing data using bottom-k sketches PODC 2007 ACM 225 234
17. M. Datar, and S. Muthukrishnan Estimating rarity and similarity over data stream windows Algorithms ESA 2002 2002 323 335
18. M. Dietzfelbinger Universal hashing and k-wise independent random variables via integer arithmetic without primes STACS 96 1996 567 580
19. G. Feigenblat, O. Itzhaki, and E. Porat The frequent items problem, under polynomial decay, in the streaming model Theor. Comput. Sci. 411 34 2010 3048 3054
20. G. Feigenblat, E. Porat, A. Shiftan, Even better framework for min-wise based algorithms, 2011.
21. G. Feigenblat, E. Porat, and A. Shiftan Exponential time improvement for min-wise based algorithms SODA 2011
22. G. Feigenblat, E. Porat, and A. Shiftan Exponential space improvement for minwise based algorithms FSTTCS 2012 70 85
23. A. Gilbert, Y. Li, E. Porat, and M. Strauss Approximate sparse recovery: optimizing time and measurements Proceedings of the 42nd ACM Symposium on Theory of Computing 2010 ACM 475 484
24. P. Indyk A small approximately min-wise independent family of hash functions J. Algorithms 2001
25. D. Kane, J. Nelson, E. Porat, and D. Woodruff Fast moment estimation in data streams in optimal space STOC 2011
26. T. Kopelowitz, E. Porat, Efficient bit space and time complexities for bottom-k sketching, 2005.
27. M. Kosinski, Y. Bachrach, P. Kohli, D. Stillwell, and T. Graepel Manifestations of user personality in website choice and behaviour on online social networks Mach. Learn. 95 3 2014 357 380
28. M. Kosinski, D. Stillwell, and T. Graepel Private traits and attributes are predictable from digital records of human behavior Proc. Natl. Acad. Sci. USA 110 15 2013 5802 5805
29. R. Krauthgamer, A. Mehta, V. Raman, A. Rudra, Greedy list intersection, 2008.
30. P. Li, and C. Koenig b-Bit minwise hashing Proceedings of the 19th International Conference on World Wide Web 2010 ACM 671 680
31. O. Lipsky, and E. Porat Improved sketching of hamming distance with error correcting CPM 2007 173 182
32. S. Lovett, and E. Porat A lower bound for dynamic approximate membership data structures 2010 51st Annual IEEE Symposium on Foundations of Computer Science FOCS 2010 IEEE 797 804
33. K. Mulmuley Randomized geometric algorithms and pseudorandom generators Algorithmica 16 4 1996 450 463
34. B. Porat, and E. Porat Exact and approximate pattern matching in the streaming model FOCS 2009
35. M. Theobald, J. Siddharth, and A. Paepcke Spotsigs: robust and efficient near duplicate detection in large web collections Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 2008 ACM 563 570
36. M. Thorup Bottom-k and priority sampling, set similarity and subset sums with minimal independence STOC 2013
37. M. Thorup, and Y. Zhang Tabulation based 4-universal hashing with applications to second moment estimation SODA 2004 615 624
38. C. Xiao, W. Wang, X. Lin, J. Yu, and G. Wang Efficient similarity joins for near-duplicate detection ACM Trans. Database Syst. 36 3 2011 15