메뉴 건너뛰기




Volumn , Issue PART 1, 2013, Pages 142-150

Learning hash functions using column generation

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; HASH FUNCTIONS; LEARNING SYSTEMS;

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

References (25)
  • 1
    • 38749118638 scopus 로고    scopus 로고
    • Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
    • Andoni, A. and Indyk, P. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In Proc. IEEE Symp. Foundations of Computer Science, pp. 459-468, 2006.
    • (2006) Proc. IEEE Symp. Foundations of Computer Science , pp. 459-468
    • Andoni, A.1    Indyk, P.2
  • 2
    • 54249097427 scopus 로고    scopus 로고
    • Learning to hash: Forgiving hash functions and applications
    • Baluja, S. and Covell, M. Learning to hash: forgiving hash functions and applications. Data Mining & Knowledge Discovery, 17(3):402-430, 2008.
    • (2008) Data Mining & Knowledge Discovery , vol.17 , Issue.3 , pp. 402-430
    • Baluja, S.1    Covell, M.2
  • 5
    • 0036161257 scopus 로고    scopus 로고
    • Linear programming boosting via column generation
    • DOI 10.1023/A:1012470815092
    • Demiriz, A., Bennett, K.P., and Shawe-Taylor, J. Linear programming boosting via column generation. Machine Learning, 46(1):225-254, 2002. (Pubitemid 34129970)
    • (2002) Machine Learning , vol.46 , Issue.1-3 , pp. 225-254
    • Demiriz, A.1    Bennett, K.P.2    Shawe-Taylor, J.3
  • 9
    • 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. Int. Conf. Computer Vision, pp. 2130-2137, 2009.
    • (2009) Proc. Int. Conf. Computer Vision , pp. 2130-2137
    • Kulis, B.1    Grauman, K.2
  • 17
    • 84860670539 scopus 로고    scopus 로고
    • Positive semidefinite metric learning using boosting-like algorithms
    • Shen, C., Kim, J., Wang, L., and van den Hengel, A. Positive semidefinite metric learning using boosting-like algorithms. J. Machine Learning Research, 13: 1007-1036, 2012.
    • (2012) J. Machine Learning Research , vol.13 , pp. 1007-1036
    • Shen, C.1    Kim, J.2    Wang, L.3    Van Den Hengel, A.4
  • 24
    • 77956027394 scopus 로고    scopus 로고
    • Self-taught hashing for fast similarity search
    • Zhang, D., Wang, J., Cai, D., and Lu, J. Self-taught hashing for fast similarity search. In Proc. ACM SIGIR Conf., pp. 18-25, 2010b.
    • (2010) Proc. ACM SIGIR Conf. , pp. 18-25
    • Zhang, D.1    Wang, J.2    Cai, D.3    Lu, J.4
  • 25
    • 0031345518 scopus 로고    scopus 로고
    • Algorithm 778: L-BFGS-B: Fortran Subroutines for Large-Scale Bound-Constrained Optimization
    • Zhu, C., Byrd, R. H., Lu, P., and Nocedal, J. Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw., 23(4):550-560, 1997. (Pubitemid 127447768)
    • (1997) ACM Transactions on Mathematical Software , vol.23 , Issue.4 , pp. 550-560
    • Zhu, C.1    Byrd, R.H.2    Lu, P.3    Nocedal, J.4


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