Bayesian locality sensitive hashing for fast similarity search

Proceedings of the VLDB Endowment

Volumn 5, Issue 5, 2012, Pages 430-441

  Satuluri, Venu ^a   Parthasarathy, Srinivasan ^a  

^a The Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN ALGORITHMS; CANDIDATE GENERATION; CANDIDATE PRUNING; LOCALITY SENSITIVE HASHING; PROBABILISTIC GUARANTEES; SIMILARITY ESTIMATION; SIMILARITY MEASURE; SIMILARITY SEARCH;

EID: 84863752005     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2140436.2140440     Document Type: Article

References (29)

1. S. Agarwal, N. Snavely, I. Simon, S. Seitz, and R. Szeliski. Building rome in a day. In ICCV, pages 72-79, 2009.
2. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Communications of the ACM, 51:117-122, 2008.
3. R. Bayardo, Y. Ma, and R. Srikant. Scaling up all pairs similarity search. In WWW, 2007.
4. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations (extended abstract). In STOC '98, pages 327-336, New York, NY, USA, 1998. ACM.
5. A. Z. Broder, S. C. Glassman, M. S. Manasse, and G. Zweig. Syntactic clustering of the web. In WWW, 1997.
6. M. S. Charikar. Similarity estimation techniques from rounding algorithms. In STOC '02, 2002.
7. M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In SOCG, pages 253-262. ACM, 2004.
8. A. R. Didonato and A. H. Morris, Jr. Algorithm 708: Significant digit computation of the incomplete beta function ratios. ACM Trans. Math. Softw., 18, 1992.
9. T. Elsayed, J. Lin, and D. Metzler. When close enough is good enough: Approximate positional indexes for efficient ranked retrieval. In CIKM, 2011.
10. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, 1999.
11. M. Henzinger. Finding near-duplicate web pages: a large-scale evaluation of algorithms. In SIGIR, 2006.
12. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC, 1998.
13. P. Jain, B. Kulis, and K. Grauman. Fast image search for learned metrics. In IEEE CVPR, 2008.
14. H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a social network or a news media? In WWW, 2010.
15. D. Lewis, Y. Yang, T. Rose, and F. Li. Rcv1: A new benchmark collection for text categorization research. JMLR, 5:361-397, 2004.
16. P. Li and C. K̈onig. b-bit minwise hashing. In WWW, 2010.
17. D. Liben-Nowell and J. Kleinberg. The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol., 58:1019-1031, May 2007.
18. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li. Multi-probe lsh: efficient indexing for high-dimensional similarity search. In VLDB, pages 950-961, 2007.
19. G. S. Manku, A. Jain, and A. Das Sarma. Detecting near-duplicates for web crawling. In WWW, 2007.
20. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and Analysis of Online Social Networks. In IMC, 2007.
21. D. Ravichandran, P. Pantel, and E. Hovy. Randomized algorithms and nlp: using locality sensitive hash function for high speed noun clustering. In ACL, 2005.
22. V. Satuluri and S. Parthasarathy. Bayesian locality sensitive hashing for fast similarity search. arXiv:1110.1328v2 [cs.DB].
23. V. Satuluri and S. Parthasarathy. Symmetrizations for clustering directed graphs. In EDBT, 2011.
24. V. Satuluri, S. Parthasarathy, and Y. Ruan. Local graph sparsification for scalable clustering. In SIGMOD, 2011.
25. Y. Tao, K. Yi, C. Sheng, and P. Kalnis. Quality and efficiency in high dimensional nearest neighbor search. In SIGMOD, 2009.
26. C. Xiao, W. Wang, X. Lin, and J. Yu. Efficient similarity joins for near duplicate detection. In WWW, 2008.
27. C. Xiao, W. Wang, X. Lin, J. X. Yu, and G. Wang. Efficient similarity joins for near duplicate detection. ACM Transactions on Database systems, 2011.
28. J. Zhai, Y. Lou, and J. Gehrke. Atlas: a probabilistic algorithm for high dimensional similarity search. In SIGMOD, 2011.
29. X. Zhu and A. Goldberg. Introduction to semi-supervised learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, 3(1):1-130, 2009.