Optimal parameters for locality-sensitive hashing

Proceedings of the IEEE

Volumn 100, Issue 9, 2012, Pages 2604-2623

  Slaney, Malcolm ^a,b   Lifshits, Yury ^a   He, Junfeng ^a,c  

^a YAHOO RESEARCH   (United States)

^b MICROSOFT   (United States)

^c Columbia University ^*  (United States)

Author keywords

Database index; information retrieval; locality sensitive hashing; multimedia databases; nearest neighbor search

Indexed keywords

INFORMATION RETRIEVAL; QUERY PROCESSING;

COMPUTATIONAL COSTS; DATABASE INDEX; LOCALITY SENSITIVE HASHING; MULTIMEDIA DATABASE; NEAREST NEIGHBOR ALGORITHM; NEAREST NEIGHBORS; PERFORMANCE LEVEL; PROBABILISTIC APPROACHES;

NEAREST NEIGHBOR SEARCH;

EID: 84865444716     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2012.2193849     Document Type: Article

References (27)

1. S. Baluja and M. Covell, "Learning to hash: Forgiving hash functions and applications," Data Mining Knowl. Disc., vol. 17, no. 3, pp. 402-430, Dec. 2008.
2. J. L. Bentley, "Multidimensional binary search trees used for associative searching," Commun. ACM, vol. 18, no. 9, pp. 509-517, 1975.
3. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When is 'nearest neighbor' meaningful?" in Proc. Int. Conf. Database Theory, 1998, pp. 217-235.
4. M. A. Casey, C. Rhodes, and M. Slaney, "Analysis of minimum distances in high-dimensional musical spaces," IEEE Trans. Audio Speech Lang. Process., vol. 16, no. 5, pp. 1015-1028, Jul. 2008.
5. S. Dasgupta and Y. Freund, "Random projection trees for vector quantization," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3229-3242, Jul. 2009.
6. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, "Locality-sensitive hashing scheme based on p-stable distributions," in Proc. 20th Annu. Symp. Comput. Geometry, 2004, pp. 253-262.
7. W. Dong, Z. Wang, W. Josephson, M. Charikar, and K. Li, "Modeling LSH for performance tuning," in Proc. 17th ACM Conf. Inf. Knowl. Manage., 2008, pp. 669-678.
8. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in Proc. 25th Int. Conf. Very Large Data Bases, 1999, pp. 518-529.
9. A. G. Glen, L. M. Leemis, and J. H. Drew, "Computing the distribution of the product of two continuous random variables," Comput. Stat. Data Anal., vol. 44, no. 3, pp. 451-464, Jan. 2004. (Pubitemid 37358749)
10. K. Grauman, "Efficiently searching for similar images," Commun. ACM, vol. 53, no. 6, pp. 84-94, 2010.
11. J. He, R. Radhakrishnan, S.-F. Chang, and C. Bauer, "Compact hashing with joint optimization of search accuracy and time," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2011, pp. 753-760.
12. E. Hörster, M. Slaney, M. A. Ranzato, and K. Weinberger, "Unsupervised image ranking," in Proc. 1st ACM Workshop Large-Scale Multimedia Retrieval Mining, 2009, pp. 81-88.
13. H. Jégou, M. Douze, and C. Schmid, "Hamming embedding and weak geometric consistency for large scale image search," in Proc. 10th Eur. Conf. Comput. Vis. I, Marseille, France, 2008, pp. 304-317.
14. H. Jégou, M. Douze, and C. Schmid, "Product quantization for nearest neighbor search," IEEE Trans. Pattern Anal. Mach. Intell, vol. 33, no. 1, pp. 117-128, Jan. 2011.
15. H. Jégou, T. Furon, and J.-J. Fuchs, "Anti-sparse coding for approximate nearest neighbor search," INRIA Technical Report, RR-7771, Oct. 2012. [Online]. Available: http://hal.inria.fr/inria-00633193
16. B. Kulis, P. Jain, and K. Grauman, "Fast similarity search for learned metrics," IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 12, pp. 2143-2157, Dec. 2009.
17. J. He, S. Kumar, and S. F. Chang, "On the difficulty of nearest neighbor search," Int. Conf. Mach. Learn., Edinburgh, Scotland, 2012. [Online]. Available: http://www. sanjivk.com/RelativeContrast-ICML12.pdf
18. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, "MultiProbe LSH: Efficient indexing for high-dimensional similarity search," in Proc. 33rd Int. Conf. Very Large Data Bases, 2007, pp. 950-961.
19. R. B. Barimont and M. B. Shapiro, "Nearest neighbour searches and the curse of dimensionality," J. Inst. Math. Appl., vol. 24, pp. 59-70, 1979.
20. M. Muja and D. G. Lowe, "Fast approximate nearest neighbors with automatic algorithm configuration," Science, vol. 340, no. 3, pp. 331-340, 2009.
21. F. Moosmann, E. Nowak, and F. Jurie, "Randomized clustering forests for image classification," IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 9, pp. 1632-1646, Sep. 2008.
22. L. Paulevé, H. Jégou, and L. Amsaleg, "Locality sensitive hashing: A comparison of hash function types and querying mechanisms," Pattern Recognit. Lett., vol. 31, no. 11, pp. 1348-1358, Aug. 2010.
23. R. Salakhutdinov and G. Hinton, "Semantic hashing," Int. J. Approx. Reason., vol. 50, no. 7, pp. 969-978, 2009.
24. M. Slaney and M. Casey, "Locality-sensitive hashing for finding nearest neighbors," IEEE Signal Process. Mag., vol. 25, no. 2, pp. 128-131, Mar. 2008.
25. A. Wang, "An industrial-strength audio search algorithm," in Proc. ISMIR Int. Symp. Music Inf. Retrieval, Baltimore, MD, Oct. 2003, pp. 7-13.
26. Y. Weiss, A. B. Torralba, and R. Fergus, "Spectral hashing," in Proc. Neural Inf. Process. Syst., 2008, pp. 1753-1760.
27. V. M. Zolotarev, 'One-dimensional stable distributions," Translations of Mathematical Monographs. Providence, RI: AMS, 1986.