Optimal lower bounds for locality-sensitive hashing (except when q is tiny)

ACM Transactions on Computation Theory

Volumn 6, Issue 1, 2014, Pages

  O'Donnell, Ryan ^a   Wu, Yi ^b   Zhou, Yuan ^a  

^a Carnegie Mellon University   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Fourier analysis of boolean functions; Locality Sensitive Hashing; LSH; Noise sensitivity; Noise stability

Indexed keywords

FOURIER ANALYSIS; HAMMING DISTANCE; OPTIMIZATION;

APPROXIMATE NEAREST-NEIGHBOR SEARCHES; LOCALITY SENSITIVE HASHING; LOG-CONVEX FUNCTIONS; LSH; NEAREST NEIGHBOR SEARCH; NOISE SENSITIVITY; NOISE STABILITY; OPTIMAL LOWER BOUND;

BOOLEAN FUNCTIONS;

EID: 84897475487     PISSN: 19423454     EISSN: 19423462     Source Type: Journal    
DOI: 10.1145/2578221     Document Type: Article

References (19)

1. A. Andoni and P. Indyk. 2006. Efficient algorithms for substring near neighbor problem. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm. ACM, 1212.
2. A. Andoni and P. Indyk. 2008. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51, 1, 117-122.
3. J. Buhler. 2001. Efficient large-scale sequence comparison by locality-sensitive hashing. Bioinformatics 17, 5, 419-428.
4. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. D. Ullman, and C. Yang. 2002. Finding interesting associations without support pruning. IEEE Trans. Knowl. Data Eng. 13, 1, 64-78.
5. A. S. Das, M. Datar, A. Garg, and S. Rajaram. 2007. Google news personalization: Scalable online collaborative filtering. In Proceedings of the 16th International Conference on World Wide Web. ACM, 271-280.
6. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the 20th Annual Symposium on Computational Geometry (SCG'04). ACM, New York, NY, 253-262.
7. A. Gionis, P. Indyk, and R. Motwani. 1999. Similarity search in high dimensions via hashing. In Proceedings of the 25th International Conference on Very Large Data Bases.
8. P. Indyk and R. Motwani. 1998. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing. ACM, New York, NY, 604-613.
9. P. Indyk. 2001. High-dimensional Computational Geometry. Doctoral dissertation, Stanford University.
10. P. Indyk. 2004. Nearest neighbors in high-dimensional spaces. In Handbook of Discrete and Computational Geometry, Discrete Mathematics and Its Applications, Chapman and Hall/CRC, 877-892.
11. P. Indyk. 2009. Personal communication.
12. R. Motwani, A. Naor, and R. Panigrahy. 2007. Lower bounds on locality sensitive hashing. SIAM J. Disc. Math. 21, 4, 930-935.
13. T. Neylon. 2010. A locality-sensitive hash for real vectors. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. 1179-1189.
14. R. O'Donnell. 2003. Computational Applications of Noise Sensitivity. Doctoral dissertation, Massachusetts Institute of Technology.
15. R. Panigrahy. 2006. Entropy based nearest neighbor search in high dimensions. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm. ACM, 1186-1195.
16. R. Panigrahy, K. Talwar, and U. Wieder. 2008. A geometric approach to lower bounds for approximate nearneighbor search and partial match. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, 414-423.
17. D. Ravichandran, P. Pantel, and E. Hovy. 2005. Randomized algorithms and NLP: Using locality sensitive hash function for high speed noun clustering. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics, 622-629.
18. G. Shakhnarovich, P. Viola, and T. Darrell. 2003. Fast pose estimation with parameter-sensitive hashing. In Proceedings of the 9th IEEE International Conference on Computer Vision. Citeseer, 750.
19. K. Terasawa and Y. Tanaka. 2007. Spherical LSH for approximate nearest neighbor search on unit hypersphere. In Proceedings of the 10th International Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science, vol. 4619, Springer-Verlag, Berlin Heidelberg, 27-38.