메뉴 건너뛰기




Volumn , Issue , 2014, Pages 2147-2154

Collaborative hashing

Author keywords

collaborative hashing; locality sensitive hashing; matrix hashing

Indexed keywords

BINARY CODES; HASH FUNCTIONS; MATRIX ALGEBRA; PATTERN RECOGNITION;

EID: 84911430500     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2014.275     Document Type: Conference Paper
Times cited : (136)

References (20)
  • 2
    • 35348914807 scopus 로고    scopus 로고
    • Google news personalization: Scalable online collaborative filtering
    • A. S. Das, M. Datar, A. Garg, and S. Rajaram. Google news personalization: scalable online collaborative filtering. In WWW, pages 271-280, 2007.
    • (2007) WWW , pp. 271-280
    • Das, A.S.1    Datar, M.2    Garg, A.3    Rajaram, S.4
  • 3
    • 4544259509 scopus 로고    scopus 로고
    • Locality-sensitive hashing scheme based on p-stable distributions
    • M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. In SCG, 2004.
    • (2004) SCG
    • Datar, M.1    Immorlica, N.2    Indyk, P.3    Mirrokni, V.S.4
  • 4
    • 80052874105 scopus 로고    scopus 로고
    • Iterative quantization: A procrustean approach to learning binary codes
    • Y. Gong and S. Lazebnik. Iterative quantization: A procrustean approach to learning binary codes. In CVPR, 2011.
    • (2011) CVPR
    • Gong, Y.1    Lazebnik, S.2
  • 5
    • 84866651203 scopus 로고    scopus 로고
    • Mobile product search with bag of hash bits and boundary reranking
    • J. He, J. Feng, X. Liu, T. Cheng, T.-H. Lin, H. Chung, and S.-F. Chang. Mobile product search with bag of hash bits and boundary reranking. In CVPR, pages 3005-3012, 2012.
    • (2012) CVPR , pp. 3005-3012
    • He, J.1    Feng, J.2    Liu, X.3    Cheng, T.4    Lin, T.-H.5    Chung, H.6    Chang, S.-F.7
  • 6
    • 84887359482 scopus 로고    scopus 로고
    • K-means hashing: An affinity-preserving quantization method for learning binary compact codes
    • K. He, F. Wen, and J. Sun. K-means hashing: An affinity-preserving quantization method for learning binary compact codes. In IEEE CVPR, pages 2938-2945, 2013.
    • (2013) IEEE CVPR , pp. 2938-2945
    • He, K.1    Wen, F.2    Sun, J.3
  • 7
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC, 1998.
    • (1998) STOC
    • Indyk, P.1    Motwani, R.2
  • 8
    • 56749104169 scopus 로고    scopus 로고
    • Hamming embedding and weak geometric consistency for large scale image search
    • H. Jegou, M. Douze, and C. Schmid. Hamming embedding and weak geometric consistency for large scale image search. In ECCV, pages 304-317, 2008.
    • (2008) ECCV , pp. 304-317
    • Jegou, H.1    Douze, M.2    Schmid, C.3
  • 9
    • 80052885236 scopus 로고    scopus 로고
    • Random maximum margin hashing
    • A. Joly and O. Buisson. Random Maximum Margin Hashing. In CVPR, 2011.
    • (2011) CVPR
    • Joly, A.1    Buisson, O.2
  • 10
    • 84861200011 scopus 로고    scopus 로고
    • Collaborative filtering on a budget
    • A. Karatzoglou, A. Smola, and M. Weimer. Collaborative filtering on a budget. In AISTATS, volume 9, pages 389-396, 2010.
    • (2010) AISTATS , vol.9 , pp. 389-396
    • Karatzoglou, A.1    Smola, A.2    Weimer, M.3
  • 11
    • 84911374756 scopus 로고    scopus 로고
    • Measuring the semantic relatedness between words and images
    • C. W. Leong and R. Mihalcea. Measuring the semantic relatedness between words and images. In IWCS, pages 185-194, 2011.
    • (2011) IWCS , pp. 185-194
    • Leong, C.W.1    Mihalcea, R.2
  • 13
    • 84887385383 scopus 로고    scopus 로고
    • Hash bit selection: A unified solution for selection problems in hashing
    • X. Liu, J. He, B. Lang, and S.-F. Chang. Hash bit selection: A unified solution for selection problems in hashing. In IEEE CVPR, pages 1570-1577, 2013.
    • (2013) IEEE CVPR , pp. 1570-1577
    • Liu, X.1    He, J.2    Lang, B.3    Chang, S.-F.4
  • 14
    • 77955986970 scopus 로고    scopus 로고
    • Weakly-supervised hashing in kernel space
    • Y. Mu, J. Shen, and S. Yan. Weakly-supervised hashing in kernel space. In CVPR, 2010.
    • (2010) CVPR
    • Mu, Y.1    Shen, J.2    Yan, S.3
  • 15
    • 84887387629 scopus 로고    scopus 로고
    • Cartesian k-means
    • M. Norouzi and D. J. Fleet. Cartesian k-means. In IEEE CVPR, pages 3017-3024, 2013.
    • (2013) IEEE CVPR , pp. 3017-3024
    • Norouzi, M.1    Fleet, D.J.2
  • 16
    • 0345414182 scopus 로고    scopus 로고
    • Video google: A text retrieval approach to object matching in videos
    • J. Sivic and A. Zisserman. Video google: A text retrieval approach to object matching in videos. In ICCV, 2003.
    • (2003) ICCV
    • Sivic, J.1    Zisserman, A.2
  • 17
    • 77955996870 scopus 로고    scopus 로고
    • Locality-constrained linear coding for image classification
    • J. Wang, J. Yang, K. Yu, F. Lv, T. Huang, and Y. Gong. Locality-constrained linear coding for image classification. In IEEE CVPR, pages 3360-3367, 2010.
    • (2010) IEEE CVPR , pp. 3360-3367
    • Wang, J.1    Yang, J.2    Yu, K.3    Lv, F.4    Huang, T.5    Gong, Y.6
  • 19
    • 77952306487 scopus 로고    scopus 로고
    • Laplacian co-hashing of terms and documents
    • D. Zhang, J. Wang, D. Cai, and J. Lu. Laplacian co-hashing of terms and documents. In ECIR, pages 577-580, 2010.
    • (2010) ECIR , pp. 577-580
    • Zhang, D.1    Wang, J.2    Cai, D.3    Lu, J.4
  • 20
    • 84866013626 scopus 로고    scopus 로고
    • Learning binary codes for collaborative filtering
    • K. Zhou and H. Zha. Learning binary codes for collaborative filtering. In ACM SIGKDD, pages 498-506, 2012.
    • (2012) ACM SIGKDD , pp. 498-506
    • Zhou, K.1    Zha, H.2


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