메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1-8

Hashing with graphs

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;

EID: 80053456121     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (1073)

References (16)
  • 1
    • 0042378381 scopus 로고    scopus 로고
    • Laplacian eigenmaps for dimensionality reduction and data representation
    • DOI 10.1162/089976603321780317
    • Belkin, M. and Niyogi, P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373-1396, 2003. (Pubitemid 37049796)
    • (2003) Neural Computation , vol.15 , Issue.6 , pp. 1373-1396
    • Belkin, M.1    Niyogi, P.2
  • 2
    • 4344599431 scopus 로고    scopus 로고
    • Learning eigenfunctions links spectral embedding and kernel PCA
    • DOI 10.1162/0899766041732396
    • 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)
    • (2004) Neural Computation , vol.16 , Issue.10 , pp. 2197-2219
    • Bengio, Y.1    Delalleau, O.2    Le, R.N.3    Paiement, J.-F.4    Vincent, P.5    Ouimet, M.6
  • 4
    • 84945709355 scopus 로고
    • An algorithm for finding best matches in logarithmic expected time
    • 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.
    • (1977) ACM Trans. Mathematical Software , vol.3 , Issue.3 , pp. 209-226
    • Friedman, J.H.1    Bentley, J.L.2    Finkel, R.A.3
  • 6
    • 79959696213 scopus 로고    scopus 로고
    • Learning to hash with binary reconstructive embeddings
    • Kulis, B. and Darrell, T. Learning to hash with binary reconstructive embeddings. In NIPS 22, 2010.
    • (2010) NIPS 22
    • Kulis, B.1    Darrell, T.2
  • 7
    • 77953184849 scopus 로고    scopus 로고
    • Kernelized locality-sensitive hashing for scalable image search
    • Kulis, B. and Grauman, K. Kernelized locality-sensitive hashing for scalable image search. In Proc. ICCV, 2009.
    • Proc. ICCV, 2009
    • Kulis, B.1    Grauman, K.2
  • 8
    • 70350618771 scopus 로고    scopus 로고
    • Fast similarity search for learned metrics
    • Kulis, B., Jain, P., and Grauman, K. Fast similarity search for learned metrics. IEEE Trans. on PAMI, 31(12):2143-2157, 2009.
    • (2009) IEEE Trans. on PAMI , vol.31 , Issue.12 , pp. 2143-2157
    • Kulis, B.1    Jain, P.2    Grauman, K.3
  • 9
    • 77956555216 scopus 로고    scopus 로고
    • Large graph construction for scalable semi-supervised learning
    • Liu, W., He, J., and Chang, S.-F. Large graph construction for scalable semi-supervised learning. In Proc. ICML, 2010.
    • Proc. ICML, 2010
    • Liu, W.1    He, J.2    Chang, S.-F.3
  • 10
    • 84860628701 scopus 로고    scopus 로고
    • Locality-sensitive binary codes from shift-invariant kernels
    • Raginsky, M. and Lazebnik, S. Locality-sensitive binary codes from shift-invariant kernels. In NIPS 22, 2010.
    • (2010) NIPS 22
    • Raginsky, M.1    Lazebnik, S.2
  • 11
    • 70049096835 scopus 로고    scopus 로고
    • Learning a nonlinear embedding by preserving class neighbourhood structure
    • Salakhutdinov, R. R. and Hinton, G. E. Learning a nonlinear embedding by preserving class neighbourhood structure. In Proc. AISTATS, 2007.
    • Proc. AISTATS, 2007
    • Salakhutdinov, R.R.1    Hinton, G.E.2
  • 12
    • 0034244751 scopus 로고    scopus 로고
    • Normalized cuts and image segmentation
    • Shi, J. and Malik, J. Normalized cuts and image segmentation. IEEE Trans. on PAMI, 22(8):888-905, 2000.
    • (2000) IEEE Trans. on PAMI , vol.22 , Issue.8 , pp. 888-905
    • Shi, J.1    Malik, J.2
  • 13
    • 77956496400 scopus 로고    scopus 로고
    • Sequential projection learning for hashing with compact codes
    • Wang, J., Kumar, S., and Chang, S.-F. Sequential projection learning for hashing with compact codes. In Proc. ICML, 2010a.
    • Proc. ICML, 2010
    • Wang, J.1    Kumar, S.2    Chang, S.-F.3
  • 16
    • 84899010839 scopus 로고    scopus 로고
    • Using the nyström method to speed up kernel machines
    • Williams, C. K. I. and Seeger, M. Using the nyström method to speed up kernel machines. In NIPS 13, 2001.
    • (2001) NIPS 13
    • Williams, C.K.I.1    Seeger, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.