Exponential space improvement for min-wise based algorithms

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 18, Issue , 2012, Pages 70-85

  Feigenblat, Guy ^a,b   Porat, Ely ^a   Shiftan, Ariel ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

Hash functions; Min wise; On line algorithms; Similarity; Streaming; Sub linear algorithms

Indexed keywords

ALTERNATIVE APPROACH; DEGREE OF INDEPENDENCE; EQUAL PROBABILITY; MIN-WISE; ON-LINE ALGORITHMS; RANDOM FUNCTIONS; SIMILARITY; SPACE CONSTRUCTIONS;

ACOUSTIC STREAMING; SOFTWARE ENGINEERING;

HASH FUNCTIONS;

EID: 84880212113     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2012.70     Document Type: Conference Paper

References (26)

1. Yoram Bachrach, Ralf Herbrich, and Ely Porat. Sketching algorithms for approximating rank correlations in collaborative filtering systems. In Jussi Karlgren, Jorma Tarhio, and Heikki Hyyrö, editors, SPIRE, volume 5721 of Lecture Notes in Computer Science, pages 344-352. Springer, 2009.
2. Yoram Bachrach and Ely Porat. Fast pseudo-random fingerprints. volume abs/1009.5791, 2010.
3. Yoram Bachrach, Ely Porat, and Jeffrey S. Rosenschein. Sketching techniques for collaborative filtering. In The Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009), pages 2016-2021, Pasadena, California, July 2009.
4. Andrei Z. Broder. On the resemblance and containment of documents. In In Compression and Complexity of Sequences (SEQUENCES97, pages 21-29. IEEE Computer Society, 1997.
5. Andrei Z. Broder. Identifying and filtering near-duplicate documents. In COM '00: Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, pages 1-10, London, UK, 2000. Springer-Verlag.
6. Andrei Z. Broder, Moses Charikar, Alan M. Frieze, and Michael Mitzenmacher. Min-wise independent permutations (extended abstract). In STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 327-336, New York, NY, USA, 1998. ACM.
7. Andrei Z. Broder, Steven C. Glassman, Mark S. Manasse, and Geoffrey Zweig. Syntactic clustering of the web. In Selected papers from the sixth international conference on World Wide Web, pages 1157-1166, Essex, UK, 1997. Elsevier Science Publishers Ltd.
8. Edith Cohen. Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci., 55(3):441-453, 1997.
9. Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, and Cheng Yang. Finding interesting associations without support pruning, 1999.
10. Edith Cohen and Haim Kaplan. Summarizing data using bottom-k sketches. In PODC, pages 225-234, 2007.
11. Edith Cohen and Haim Kaplan. Tighter estimation using bottom k sketches. PVLDB, 1(1):213-224, 2008.
12. Graham Cormode and S. Muthukrishnan. What's new: finding significant differences in network data streams. IEEE/ACM Trans. Netw., 13(6):1219-1232, 2005.
13. Abhinandan S. Das, Mayur Datar, Ashutosh Garg, and Shyam Rajaram. Google news personalization: scalable online collaborative filtering. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 271-280, New York, NY, USA, 2007. ACM.
14. Mayur Datar and S Muthukrishnan. Estimating rarity and similarity over data stream windows. In In Proceedings of 10th Annual European Symposium on Algorithms, volume 2461 of Lecture Notes in Computer Science, pages 323-334, 2002.
15. Guy Feigenblat, Ely Porat, and Ariel Shiftan. Exponential time improvement for min-wise based algorithms. In To appear SODA '11: Proceedings of the 22nd annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, 2011.
16. Sumit Ganguly, Minos Garofalakis, and Rajeev Rastogi. Processing set expressions over continuous update streams. In SIGMOD '03: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pages 265-276, New York, NY, USA, 2003. ACM.
17. Phillip B. Gibbons and Srikanta Tirthapura. Estimating simple functions on the union of data streams. In SPAA '01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, pages 281-291, New York, NY, USA, 2001. ACM.
18. Taher H. Haveliwala, Aristides Gionis, Dan Klein, and Piotr Indyk. Evaluating strategies for similarity search on the web. In WWW '02: Proceedings of the 11th international conference on World Wide Web, pages 432-442, New York, NY, USA, 2002. ACM.
19. Monika Henzinger. Finding near-duplicate web pages: a large-scale evaluation of algorithms. In SIGIR '06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, pages 284-291, New York, NY, USA, 2006. ACM.
20. Piotr Indyk. A small approximately min-wise independent family of hash functions. In Journal of Algorithms, pages 454-456, 1999.
21. Gurmeet Singh Manku, Arvind Jain, and Anish Das Sarma. Detecting near-duplicates for web crawling. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 141-150, New York, NY, USA, 2007. ACM.
22. K. Mulmuley. Randomized geometric algorithms and pseudo-random generators. In SFCS '92: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 90-100, Washington, DC, USA, 1992. IEEE Computer Society.
23. Mihai Pǎtraşcu and Mikkel Thorup. On the k-independence required by linear probing and minwise independence. In Proc. 37th International Colloquium on Automata, Languages and Programming (ICALP), pages 715-726, 2010.
24. Mihai Pǎtraşcu and Mikkel Thorup. The power of simple tabulation hashing. In Proc. 43rd ACM Symposium on Theory of Computing (STOC), 2011. To appear. See also arXiv:1011.5200.
25. Michael Saks, Aravind Srinivasan, Shiyu Zhou, and David Zuckerman. Low discrepancy sets yield approximate min-wise independent permutation families. In In Proc. International Workshop on Randomization and Approximation Techniques in Computer Science, pages 29-32. Springer, 1999.
26. Hui Yang and Jamie Callan. Near-duplicate detection by instance-level constrained clustering. In SIGIR '06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, pages 421-428, New York, NY, USA, 2006. ACM.