Linear spectral hashing

Neurocomputing

Volumn 141, Issue , 2014, Pages 117-123

  Bodó, Zalán ^a   Csató, Lehel ^a  

^a BABE BOLYAI UNIVERSITY   (Romania)

Author keywords

Nearest neighbor search; Spectral clustering; Spectral hashing

Indexed keywords

NEURAL NETWORKS;

GENERATION METHOD; LINEAR ALGORITHMS; LOCALITY SENSITIVE HASHING; NEAREST NEIGHBOR SEARCH; SIMILARITY MEASURE; SPECIFIC PROBLEMS; SPECTRAL CLUSTERING; SPECTRAL HASHING;

COMPUTER APPLICATIONS;

ACCURACY; ARTICLE; INTERMETHOD COMPARISON; K NEAREST NEIGHBOR; KERNEL METHOD; LEARNING ALGORITHM; LINEAR SPECTRAL HASHING; LINEAR SYSTEM; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL; NONLINEAR SYSTEM; PRIORITY JOURNAL; PROCESS OPTIMIZATION;

EID: 84901625403     PISSN: 09252312     EISSN: 18728286     Source Type: Journal    
DOI: 10.1016/j.neucom.2013.11.039     Document Type: Article

References (29)

1. Cover T.M., Hart P.E. Nearest neighbor pattern classification. in: IEEE Transactions on Information Theory IT-13 1967, IT-13(1):21-27.
2. Rajaraman A., Ullman J.D. Mining of Massive Datasets 2012, Cambridge University Press Cambridge, UK.
3. Bentley J.L. Multidimensional binary search trees used for associative searching. Commun. ACM 1975, 18(9):509-517.
4. Salakhutdinov R., Hinton G.E. Semantic hashing. Int. J. Approx. Reason. 2009, 50(7):969-978.
5. A. Gionis, P. Indyk, R. Motwani, Similarity search in high dimensions via hashing, in: Proceedings of the 25th International Conference on Very Large Data Bases (VLDB '99), Morgan Kaufmann, San Francisco, 1999, pp. 518-529.
6. Grauman K., Fergus R. Learning binary hash codes for large-scale image search. Mach. Learn. Comput. Vis. 2013, 411:49-87.
7. M. Charikar, Similarity estimation techniques from rounding algorithms, in: STOC, 2002, pp. 380-388.
8. B. Kulis, K. Grauman, Kernelized locality-sensitive hashing for scalable image search, in: ICCV, IEEE, 2009, pp. 2130-2137.
9. Y. Weiss, A.B. Torralba, R. Fergus, Spectral hashing, in: NIPS, MIT Press, 2008, pp. 1753-1760.
10. Raginsky M., Lazebnik S. Locality-sensitive binary codes from shift-invariant kernels. NIPS 2009, 1509-1517. Curran Associates, Inc. Y. Bengio, D. Schuurmans, J.D. Lafferty, C.K.I. Williams, A. Culotta (Eds.).
11. A. Rahimi, B. Recht, Random features for large-scale kernel machines, in: J.C. Platt, D. Koller, Y. Singer, S.T. Roweis (Eds.), NIPS, 2007.
12. Zhang D., Wang J., Cai D., Lu J. Self-taught hashing for fast similarity search. SIGIR 2010, 18-25. ACM. F. Crestani, S. Marchand-Maillet, H.-H. Chen, E.N. Efthimiadis, J. Savoy (Eds.).
13. Zhang D., Wang J., Cai D., Lu J. Laplacian co-hashing of terms and documents. ECIR, Lecture Notes in Computer Science 2010, vol. 5993:577-580. Springer.
14. G. Shakhnarovich, P.A. Viola, T.J. Darrell, Fast pose estimation with parameter-sensitive hashing, in: ICCV, 2003, pp. 750-757.
15. P. Jain, B. Kulis, K. Grauman, Fast image search for learned metrics, in: CVPR, IEEE Computer Society, 2008.
16. J. Wang, O. Kumar, S.-F. Chang, Semi-supervised hashing for scalable image retrieval, in: CVPR, IEEE, 2010, pp. 3424-3431.
17. Wang J., Kumar S., Chang S.-F. Semi-supervised hashing for large-scale search. IEEE Trans. Pattern Anal. Mach. Intell. 2012, 34(12):2393-2406.
18. von Luxburg U. A tutorial on spectral clustering. Stat. Comput. 2007, 17(4):395-416.
19. J. Shi, J. Malik, Normalized cuts and image segmentation, in: CVPR, IEEE Computer Society, 1997, pp. 731-737.
20. A. Rahimi, B. Recht, Clustering with normalized cuts is clustering with a hyperplane, in: Statistical Learning in Computer Vision, 2004.
21. Lütkepohl H. Handbook of Matrices 1996, John Wiley & Sons Ltd., Chichester.
22. Golub G.H., van Loan C.F. Matrix Computations 1996, Johns Hopkins University Press. 3rd edition.
23. Belkin M., Niyogi P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput. 2003, 15(6):1373-1396.
24. Tenenbaum J.B., de Silva V., Langford J.C. A global geometric framework for nonlinear dimensionality reduction. Science 2000, 290(5500):2319-2323.
25. Roweis S.T., Saul L.K. Nonlinear dimensionality reduction by locally linear embedding. Science 2000, 290(5500):2323-2326.
26. Ng A., Jordan M., Weiss Y. On spectral clustering. analysis and an algorithm. Advances in Neural Information Processing Systems 2001, 849-856. MIT Press Cambridge, MA. T. Dietterich, S. Becker, Z. Ghahramani (Eds.).
27. Sebastiani F. Machine learning in automated text categorization. ACM Comput. Surv. 2002, 34(1):1-47.
28. Schölkopf B., Smola A.J. Learning with Kernels 2002, The MIT Press, Cambridge, MA.
29. A.M. Frieze, R. Kannan, S. Vempala, Fast monte-carlo algorithms for finding low-rank approximations, in: FOCS, IEEE Computer Society, 1998, pp. 370-378.