DSH: Data Sensitive Hashing for high-dimensional k-NN search

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2014, Pages 1127-1138

  Gao, Jinyang ^a   Jagadish, H V ^b   Lu, Wei ^a   Ooi, Beng Chin ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Hashing; High Dimensions; LSH; Similarity Search

Indexed keywords

ORTHOGONAL FUNCTIONS; QUERY PROCESSING;

HASHING; HIGH DIMENSIONAL SPACES; HIGH DIMENSIONS; LOCALITY SENSITIVE HASHING; LSH; SIMILARITY SEARCH; STATE-OF-THE-ART APPROACH; THEORETICAL GUARANTEES;

IMAGE RETRIEVAL;

EID: 84904366650     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2588555.2588565     Document Type: Conference Paper

References (23)

1. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In FOCS, pages 459-468, 2006.
2. K. Andreev and H. Racke. Balanced graph partitioning. Theory of Computing Systems, pages 929-939, 2006.
3. V. Athitsos, J. Alon, S. Sclaroff, and G. Kollios. Boostmap: A method for efficient approximate similarity rankings. In CVPR, pages II-268, 2004.
4. V. Athitsos, M. Hadjieleftheriou, G. Kollios, and S. Sclaroff. Query-sensitive embeddings. In SIGMOD, pages 706-717, 2005.
5. V. Athitsos, M. Potamias, P. Papapetrou, and G. Kollios. Nearest neighbor retrieval using distance-based hashing. In ICDE, pages 327-336, 2008.
6. M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural computation, pages 1373-1396, 2003.
7. E. Chávez, G. Navarro, R. Baeza-Yates, and J. L. Marroquín. Searching in metric spaces. ACM Computing Surveys, pages 273-321, 2001.
8. Y. Freund and R. E. Schapire. A desicion-theoretic generalization of on-line learning and an application to boosting. In Computational Learning Theory, pages 23-37, 1995.
9. J. Gan, J. Feng, Q. Fang, and W. Ng. Locality-sensitive hashing scheme based on dynamic collision counting. In SIGMOD, pages 541-552, 2012.
10. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, pages 518-529, 1999.
11. G. R. Hjaltason and H. Samet. Index-driven similarity search in metric spaces (survey article). TODS, pages 517-580, 2003.
12. B. Kulis and K. Grauman. Kernelized locality-sensitive hashing for scalable image search. In ICCV, pages 2130-2137, 2009.
13. 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.
14. X. Niyogi. Locality preserving projections. In NIPS, pages 153-160, 2004.
15. R. Panigrahy. Entropy based nearest neighbor search in high dimensions. In SODA, pages 1186-1195, 2006.
16. R. Salakhutdinov and G. E. Hinton. Learning a nonlinear embedding by preserving class neighbourhood structure. In AI and Statistics, pages 412-419, 2007.
17. V. Satuluri and S. Parthasarathy. Bayesian locality sensitive hashing for fast similarity search. VLDB, pages 430-441, 2012.
18. R. E. Schapire. The boosting approach to machine learning: An overview. LECTURE NOTES IN STATISTICS, pages 149-172, 2003.
19. G. Shakhnarovich, P. Viola, and T. Darrell. Fast pose estimation with parameter-sensitive hashing. In ICCV, pages 750-757, 2003.
20. Y. Tao, K. Yi, C. Sheng, and P. Kalnis. Quality and efficiency in high dimensional nearest neighbor search. In SIGMOD, pages 563-576, 2009.
21. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In VLDB, pages 194-205, 1998.
22. Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, pages 1753-1760, 2008.
23. C. Yu, B. C. Ooi, K.-L. Tan, and H. V. Jagadish. Indexing the distance: An efficient method to knn processing. In VLDB, pages 421-430, 2001.