Non-metric locality-sensitive hashing

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 539-544

  Mu, Yadong ^a   Yan, Shuicheng ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY BITS; COLLISION PROBABILITY; EMPIRICAL EVALUATIONS; FEATURE SPACE; HUMAN PERCEPTION; LOCALITY SENSITIVE HASHING; NON-METRIC; REPRODUCING KERNEL;

ARTIFICIAL INTELLIGENCE;

EID: 77958602311     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Andoni, A., and Indyk, P. 2008. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1): 117-122.
2. Barrow, H. G.; Tenenbaum, J. M.; Bolles, R. C; and Wolf, H. C. 1977. Parametric correspondence and chamfer matching: Two new techniques for image matching. In IJCAI, 659-663.
3. Bentley, J. 1975. Multidimensional binary search trees used for associative searching. Commun. ACM 18(9):509-517.
4. Bognar, J. 1974. Indefinite inner product spaces. Springer-Verlag.
5. Bregman, L. M. 1967. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics 7:200-217.
6. Broder, A. Z.; Glassman, S. C; Manasse, M. S.; and Zweig, G. 1997. Syntactic clustering of the web. Computer Networks 29(8-13): 1157-1166.
7. Cayton, L. 2008. Fast nearest neighbor retrieval for bregman divergences. In ICML, 112-119.
8. Charikar, M. 2002. Similarity estimation techniques from rounding algorithms. In STOC, 380-388.
9. Datar, M.; Immorlica, N.; Indyk, P.; and Mirrokni, V. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the twentieth annual symposium on Computational geometry, 253-262.
10. Indyk, P., and Motwani, R. 1998. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC.
11. Jacobs, D.; Weinshall, D.; and Gdalyahu, Y. 2000. Classification with nonmetric distances: Image retrieval and class representation. IEEE Trans. Pattern Anal. Mack Intell. 22(6):583-600.
12. Kulis, B., and Grauman, K. 2009. Kernelized locality-sensitive hashing for scalable image search. In ICCV.
13. Laub, J., and Müller, K.-R. 2004. Feature discovery in non-metric pairwise data. Journal of Machine Learning Research 5:801-818.
14. Laub, J.; Macke, J.; Müller, K.-R.; and Wichmann, F. A. 2006. Inducing metric violations in human similarity judgements. In NIPS, 777-784.
15. Pekalska, E., and Haasdonk, B. 2009. Kernel discriminant analysis for positive definite and indefinite kernels. Pattern Analysis and Machine Intelligence, IEEE Transactions on 31(6): 1017-1032.
16. Schölkopf, B., and Smola, A. J. 2001. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. Cambridge, MA, USA: MIT Press.
17. Schölkopf, B.; Smola, A. J.; and Müller, K.-R. 1998. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation 10(5): 1299-1319.
18. Tversky, A. 1977. Features of similarity. Psychological Review 84:327-352.
19. Yianilos, P. N. 1993. Data structures and algorithms for nearest neighbor search in general metric spaces. In SODA.
20. Young, G., and Householder, A. 1938. Discussion of a set of points in terms of their mutual distances. Psychometrika 3(1): 19-22.
21. Zhang, Z.; Ooi, B. C; Parthasarathy, S.; and Tung, A. K. H. 2009. Similarity search on bregman divergence: Towards non-metric indexing. PVLDB 2(1): 13-24.