Bi-level locality sensitive hashing for k-nearest neighbor computation

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2012, Pages 378-389

  Pan, Jia ^a   Manocha, Dinesh ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; HASH TABLE; HIERARCHICAL STRUCTURES; HIGH DIMENSIONAL SPACES; HIGH-DIMENSIONAL IMAGES; K NEAREST NEIGHBOR SEARCH; K-NEAREST NEIGHBORS; K-NN QUERY; LOCALITY SENSITIVE HASHING; QUALITY OF RESULTS; RUNTIME COSTS; RUNTIMES; SECOND LEVEL; SPACE-FILLING CURVE; SUB-GROUPS;

ALGORITHMS; ASPECT RATIO;

IMAGE RETRIEVAL;

EID: 84864265150     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2012.40     Document Type: Conference Paper

References (29)

1. C. Shahabi, M. R. Kolahdouzan, and M. Sharifzadeh, "A road network embedding technique for k-nearest neighbor search in moving object databases," in SIGSPATIAL GIS, 2002, pp. 94-100.
2. A. Beygelzimer, S. Kakade, and J. Langford, "Cover trees for nearest neighbor," in International Conference on Machine Learning, 2006, pp. 97-104.
3. N. Katayama and S. Satoh, "The SR-tree: an index structure for highdimensional nearest neighbor queries," in International Conference on Management of Data, 1997, pp. 369-380.
4. R. Weber, H.-J. Schek, and S. Blott, "A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces," in International Conference on Very Large Data Bases, 1998, pp. 194-205.
5. J. M. Kleinberg, "Two algorithms for nearest-neighbor search in high dimensions," in Symposium on Theory of Computing, 1997, pp. 599-608.
6. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, "Locality-sensitive hashing scheme based on p-stable distributions," in Symposium on Computational Geometry, 2004, pp. 253-262.
7. A. Gionis, P. Indyk, and R. Motwani, "Similarity search in high dimensions via hashing," in International Conference on Very Large Data Bases, 1999, pp. 518-529.
8. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, "Multiprobe LSH: efficient indexing for high-dimensional similarity search," in International Conference on Very Large Data Bases, 2007, pp. 950-961.
9. M. Bawa, T. Condie, and P. Ganesan, "LSH forest: self-tuning indexes for similarity search," in International Conference on World Wide Web, 2005, pp. 651-660.
10. W. Dong, Z. Wang, W. Josephson, M. Charikar, and K. Li, "Modeling lsh for performance tuning," in Conference on Information and Knowledge Management, 2008, pp. 669-678.
11. A. Andoni and P. Indyk, "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions," in Symposium on Foundations of Computer Science, 2006, pp. 459-468.
12. H. Jégou, L. Amsaleg, C. Schmid, and P. Gros, "Query adaptative locality sensitive hashing," in International Conference on Acoustics, Speech and Signal Processing, 2008, pp. 825-828.
13. M. Raginsky and S. Lazebnik, "Locality-sensitive binary codes from shift-invariant kernels," in Advances in Neural Information Processing Systems, 2009.
14. J. He, W. Liu, and S.-F. Chang, "Scalable similarity search with optimized kernel hashing," in International Conference on Knowledge Discovery and Data Mining, 2010, pp. 1129-1138.
15. A. Dhesi and P. Kar, "Random projection trees revisted," in Advances in Neural Information Processing Systems, 2010.
16. J. Pan and D. Manocha, "Fast GPU-based locality sensitive hashing for k-nearest neighbor computation," in International Conference on Advances in Geographic Information Systems, 2011.
17. D. E. Knuth, The art of computer programming, volume 3: sorting and searching. Addison Wesley Longman Publishing Co., Inc., 1998.
18. A. Joly and O. Buisson, "A posteriori multi-probe locality sensitive hashing," in International Conference on Multimedia, 2008, pp. 209-218.
19. Y. Freund, S. Dasgupta, M. Kabra, and N. Verma, "Learning the structure of manifolds using random projections," in Advances in Neural Information Processing Systems, 2007.
20. S. Dasgupta and Y. Freund, "Random projection trees and low dimensional manifolds," in Symposium on Theory of Computing, 2008, pp. 537-546.
21. D. Yan, L. Huang, and M. I. Jordan, "Fast approximate spectral clustering," in International Conference on Knowledge Discovery and Data Mining, 2009, pp. 907-916.
22. O. Egecioglu and B. Kalantari, "Approximating the diameter of a set of points in the Euclidean space," Information Processing Letters, vol. 32, pp. 205-211, 1989.
23. S. Liao, M. A. Lopez, and S. T. Leutenegger, "High dimensional similarity search with space filling curves," in International Conference on Data Engineering, 2001, pp. 615-622.
24. K. Kato and T. Hosino, "Multi-GPU algorithm for k-nearest neighbor problem," Concurrency and Computation: Practice and Experience, vol. 23, 2011.
25. S. Brown and J. Snoeyink, "GPU nearest neighbors using a minimal kd-tree," in Workshop on Massive Data Algorithmics, 2010.
26. J. Pan, C. Lauterbach, and D. Manocha, "Efficient nearest-neighbor computation for GPU-based motion planning," in International Conference on Intelligent Robots and Systems, 2010, pp. 2243-2248.
27. D. A. Alcantara, A. Sharf, F. Abbasinejad, S. Sengupta, M. Mitzenmacher, J. D. Owens, and N. Amenta, "Real-time parallel hashing on the GPU," ACM Transations on Graphics, vol. 28, pp. 154:1-9, 2009.
28. J. Pan and D. Manocha, "Gpu-based parallel collision detection for fast motion planning," International Journal of Robotics Research, to appear.
29. H. Sundell and P. Tsigas, "Fast and lock-free concurrent priority queues for multi-thread systems," Journal of Parallel and Distributed Computing, vol. 65, pp. 609-627, 2005.