Exponential time improvement for min-wise based algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 57-66

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

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES;

DATA STREAM; EFFICIENT TIME; EXPONENTIAL TIME; NOVEL TECHNIQUES; RANDOM CHOICE; RANDOM FUNCTIONS; SIMILARITY ESTIMATION; SPACE CONSTRUCTIONS;

HASH FUNCTIONS;

EID: 79955736273     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.5     Document Type: Conference Paper

References (31)

1. lndyk, P.: A small approximately min-wise independent family of hash functions. In: Journal of Algorithms. (1999) 454-456.
2. Cohen, E., Kaplan, H.: Tighter estimation using bottom k sketches. PVLDB 1(1) (2008) 213-224.
3. Cohen, E., Kaplan, H.: Summarizing data using bottom-k sketches. In: PODC. (2007) 225-234. (Pubitemid 350229319)
4. Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci. 55(3) (1997) 441-453. (Pubitemid 127432363)
5. Datar, M., Muthukrishnan, S.: 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. (2002) 323-334.
6. Broder, A.Z.: Identifying and filtering near-duplicate documents. In: COM'00: Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, London, UK, Springer-Verlag (2000) 1-10.
7. Haveliwala, T.H., Gionis, A., Klein, D., Indyk, P.: Evaluating strategies for similarity search on the web. In: WWW'02: Proceedings of the 11th international conference on World Wide Web, New York, NY, USA, ACM (2002) 432-442.
8. Bachrach, Y., Herbrich, R., Porat, E.: Sketching algorithms for approximating rank correlations in collaborative filtering systems. In Karlgren, J., Tarhio, J., Hyyrö, H., eds.: SPIRE. Volume 5721 of Lecture Notes in Computer Science., Springer (2009) 344-352.
9. Bachrach, Y., Porat, E., Rosenschein, J.S.: Sketching techniques for collaborative filtering. In: The Twenty- First International Joint Conference on Artificial Intelligence (IJCAI 2009), Pasadena, California (2009) 2016-2021.
10. Manku, G.S., Jain, A., Das Sarma, A.: Detecting near-duplicates for web crawling. In: WWW'07: Proceedings of the 16th international conference on World Wide Web, New York, NY, USA, ACM (2007) 141-150. (Pubitemid 47582246)
11. Cormode, G., Muthukrishnan, S.: What's new: finding significant differences in network data streams. IEEE/ACM Trans. Netw. 13(6) (2005) 1219-1232. (Pubitemid 43034131)
12. Ganguly, S., Garofalakis, M., Rastogi, R.: Processing set expressions over continuous update streams. In: SIGMOD'03: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, New York, NY, USA, ACM (2003) 265-276.
13. Das, A.S., Datar, M., Garg, A., Rajaram, S.: Google news personalization: scalable online collaborative filtering. In: WWW'07: Proceedings of the 16th international conference on World Wide Web, New York, NY, USA, ACM (2007) 271-280. (Pubitemid 47582257)
14. Gibbons, P.B., Tirthapura, S.: Estimating simple functions on the union of data streams. In: SPAA'01: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, New York, NY, USA, ACM (2001) 281-291.
15. Haveliwala, T.H., Gionis, A., Klein, D., Indyk, P.: Evaluating strategies for similarity search on the web. In: WWW'02: Proceedings of the 11th international conference on World Wide Web, New York, NY, USA, ACM (2002) 432-442.
16. Yang, H., Callan, J.: 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, New York, NY, USA, ACM (2006) 421-428.
17. Henzinger, M.: 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, New York, NY, USA, ACM (2006) 284-291.
18. Krauthgamer, R., Mehta, A., Raman, V., Rudra, A.: Greedy list intersection. In: IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008. (2008) 1033-1042.
19. Bachrach, Y., Herbrich, R.: Fingerprinting Ratings For Collaborative Filtering Theoretical and Empirical Analysis. (2010).
20. Chakrabarti, A., Cormode, G., McGregor, A.: A near-optimal algorithm for computing the entropy of a stream. In Bansal, N., Pruhs, K., Stein, C., eds.: SODA, SIAM (2007) 328-335.
21. Mulmuley, K.: Randomized geometric algorithms and pseudo-random generators. In: SFCS'92: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, Washington, DC, USA, IEEE Computer Society (1992) 90-100.
22. Broder, A.Z., Charikar, M., Frieze, A.M., Mitzen-macher, M.: Min-wise independent permutations (extended abstract). In: STOC'98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, New York, NY, USA, ACM (1998) 327-336.
23. Broder, A.Z.: On the resemblance and containment of documents. In: In Compression and Complexity of Sequences (SEQUENCES97, IEEE Computer Society (1997) 21-29.
24. Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic clustering of the web. In: Selected papers from the sixth international conference on World Wide Web, Essex, UK, Elsevier Science Publishers Ltd. (1997) 1157-1166.
25. Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J.D., Yang, C.: Finding interesting associations without support pruning (1999).
26. Saks, M., Srinivasan, A., Zhou, S., Zuckerman, D.: Low discrepancy sets yield approximate min-wise independent permutation families. In: In Proc. International Workshop on Randomization and Approximation Techniques in Computer Science, Springer (1999) 29-32. (Pubitemid 30563377)
27. Pàtraşcu, M., Thorup, M.: On the k-independence required by linear probing and minwise independence. In: Proc. 37th International Colloquium on Automata, Languages and Programming (ICALP). (2010) To appear.
28. Broder, A.Z., Charikar, M., Mitzenmacher, M.: A de-randomization using min-wise independent permutations. In: In Randomization and approximation techniques in computer science, (Springer) 15-24.
29. Aho, A.V., Hopcroft, J.E.: The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA (1974).
30. Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: RANDOM'02: Proceedings of the 6th International Workshop on Randomization and Approximation Techniques, London, UK, Springer-Verlag (2002) 1-10.
31. Kane, D.M., Nelson, J., Woodruff, D.P.: An optimal algorithm for the distinct elements problem. In: PODS'10: Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems of data, New York, NY, USA, ACM (2010) 41-52.