Efficient estimation for high similarities using odd sketches

WWW 2014 - Proceedings of the 23rd International Conference on World Wide Web

Volumn , Issue , 2014, Pages 109-118

  Mitzenmacher, Michael ^a   Pagh, Rasmus ^b   Pham, Ninh ^b  

^a HARVARD UNIVERSITY   (United States)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Bloom filters; Minwise hashing; Set similarity

Indexed keywords

ASSOCIATION RULES; EFFICIENCY; RELIABILITY ANALYSIS;

BLOOM FILTERS; CENTRAL PROBLEMS; DUPLICATE DETECTION; EFFICIENT ESTIMATION; MINWISE HASHING; SET SIMILARITY; SPACE EFFICIENT; SYMMETRIC DIFFERENCE;

COLLABORATIVE FILTERING;

EID: 84909632662     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2566486.2568017     Document Type: Conference Paper

References (21)

1. Y. Bachrach, E. Porat, and J. S. Rosenschein. Sketching techniques for collaborative filtering. In IJCAI, pages 2016-2021, 2009.
2. Z. Bar-Yossef, T. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In RANDOM, pages 1-10. Springer, 2002.
3. M. Bendersky and W. B. Croft. Finding text reuse on the web. In WSDM, pages 262-271, 2009.
4. A. Z. Broder. On the resemblance and containment of documents. Sequences, pages 21-29, 1997.
5. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. J. Comput. Syst. Sci., 60(3):630-659, 2000.
6. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the web. Computer Networks, 29(8-13):1157-1166, 1997.
7. F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi, and P. Raghavan. On compressing social networks. In KDD, pages 219-228, 2009.
8. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. D. Ullman, and C. Yang. Finding interesting associations without support pruning. IEEE Trans. Knowl. Data Eng., 13(1):64-78, 2001.
9. A. Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: scalable online collaborative filtering. In WWW, pages 271-280, 2007.
10. S. Gollapudi and R. Panigrahy. Exploiting asymmetry in hierarchical topic extraction. In CIKM, pages 475-482, 2006.
11. S. Gollapudi and A. Sharma. An axiomatic approach for result diversification. In WWW, pages 381-390, 2009.
12. M. R. Henzinger. Finding near-duplicate web pages: a large-scale evaluation of algorithms. In SIGIR, pages 284-291, 2006.
13. S. Ioffe. Improved consistent sampling, weighted minhash and l1 sketching. In ICDM, pages 246-255, 2010.
14. K. Kutzkov, A. Bifet, F. Bonchi, and A. Gionis. Strip: stream learning of influence probabilities. In KDD, pages 275-283, 2013.
15. P. Li and A. C. König. b-bit minwise hashing. In WWW, pages 671-680, 2010.
16. P. Li, A. Shrivastava, J. L. Moore, and A. C. König. Hashing algorithms for large-scale learning. In NIPS, pages 2672-2680, 2011.
17. M. Manasse, F. McSherry, and K. Talwar. Consistent weighted sampling. MSR-TR-2010-73 technical report, 2010.
18. G. S. Manku, A. Jain, and A. D. Sarma. Detecting near-duplicates for web crawling. In WWW, pages 141-150, 2007.
19. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
20. E. F. Schuster and A. N. Philippou. The odds in some odd-even games. The American Mathematical Monthly, 82:646-648, 1975.
21. T. Urvoy, E. Chauveau, P. Filoche, and T. Lavergne. Tracking web spam with html style similarities. TWEB, 2(1), 2008.