Hashing with graphs

Proceedings of the 28th International Conference on Machine Learning, ICML 2011

Volumn , Issue , 2011, Pages 1-8

  Liu, Wei ^a   Wang, Jun ^b   Kumar, Sanjiv ^c   Chang, Shih Fu ^a  

^a Fu Foundation School of Engineering and Applied Science   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; COMPACT CODE; CONSTANT TIME; DATA POINTS; EIGEN FUNCTION; EXPERIMENTAL COMPARISON; GRAPH LAPLACIAN; GRAPH-BASED; HASHING METHOD; LARGE DATASETS; LOW-DIMENSIONAL MANIFOLDS; MULTIPLE BITS; NEAREST NEIGHBOR SEARCH; NEAREST NEIGHBORS; NEIGHBORHOOD STRUCTURE; REAL WORLD DATA; SEARCH ACCURACY; SEARCH PERFORMANCE; SHORT CODES; STATE-OF-THE-ART METHODS; THRESHOLD LEARNING;

LEARNING SYSTEMS;

EIGENVALUES AND EIGENFUNCTIONS;

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

References (16)

1. Belkin, M. and Niyogi, P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373-1396, 2003. (Pubitemid 37049796)
2. Bengio, Y., Delalleau, O., Roux, N. Le, Paiement, J.-F., Vincent, P., and Ouimet, M. Learning eigenfunctions links spectral embedding and kernel pca. Neural Computation, 16(10):2197-2219, 2004. (Pubitemid 39137820)
3. Datar, M., Immorlica, N., Indyk, P., and Mirrokni, V. S. Locality-sensitive hashing scheme based on p-stable distributions. In Symposium on Computational Geometry, 2004.
4. Friedman, J. H., Bentley, J. L., and Finkel, R. A. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Mathematical Software, 3(3):209-226, 1977.
5. Gionis, A., Indyk, P., and Motwani, R. Similarity search in high dimensions via hashing. In Proc. VLDB, 1999.
6. Kulis, B. and Darrell, T. Learning to hash with binary reconstructive embeddings. In NIPS 22, 2010.
7. Kulis, B. and Grauman, K. Kernelized locality-sensitive hashing for scalable image search. In Proc. ICCV, 2009.
8. Kulis, B., Jain, P., and Grauman, K. Fast similarity search for learned metrics. IEEE Trans. on PAMI, 31(12):2143-2157, 2009.
9. Liu, W., He, J., and Chang, S.-F. Large graph construction for scalable semi-supervised learning. In Proc. ICML, 2010.
10. Raginsky, M. and Lazebnik, S. Locality-sensitive binary codes from shift-invariant kernels. In NIPS 22, 2010.
11. Salakhutdinov, R. R. and Hinton, G. E. Learning a nonlinear embedding by preserving class neighbourhood structure. In Proc. AISTATS, 2007.
12. Shi, J. and Malik, J. Normalized cuts and image segmentation. IEEE Trans. on PAMI, 22(8):888-905, 2000.
13. Wang, J., Kumar, S., and Chang, S.-F. Sequential projection learning for hashing with compact codes. In Proc. ICML, 2010a.
14. Wang, J., Yang, J., Yu, K., Lv, F., Huang, T., and Gong, Y. Locality-constrained linear coding for image classification. In Proc. CVPR, 2010b.
15. Weiss, Y., Torralba, A., and Fergus, R. Spectral hashing. In NIPS 21, 2009.
16. Williams, C. K. I. and Seeger, M. Using the nyström method to speed up kernel machines. In NIPS 13, 2001.