메뉴 건너뛰기




Volumn , Issue , 2013, Pages 607-616

Fast pairwise query selection for large-scale active learning to rank

Author keywords

Active Learning; Hashing; Learning to Rank

Indexed keywords


EID: 84894662428     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2013.54     Document Type: Conference Paper
Times cited : (17)

References (30)
  • 1
    • 80053390629 scopus 로고    scopus 로고
    • A short introduction to learning to rank
    • L. Hang, "A short introduction to learning to rank," IEICE TRANSACTIONS on Information and Systems, vol. 94, no. 10, pp. 1854-1862, 2011.
    • (2011) IEICE TRANSACTIONS on Information and Systems , vol.94 , Issue.10 , pp. 1854-1862
    • Hang, L.1
  • 2
    • 85156208493 scopus 로고    scopus 로고
    • Ranking with large margin principle: Two approaches
    • A. Shashua and A. Levin, "Ranking with large margin principle: Two approaches," in NIPS, 2002, pp. 937-944.
    • (2002) NIPS , pp. 937-944
    • Shashua, A.1    Levin, A.2
  • 3
    • 1942515261 scopus 로고    scopus 로고
    • Pranking with ranking
    • K. Crammer and Y. Singer, "Pranking with ranking," in NIPS, 2001, pp. 641-647.
    • (2001) NIPS , pp. 641-647
    • Crammer, K.1    Singer, Y.2
  • 4
    • 33746084489 scopus 로고    scopus 로고
    • Subset ranking using regression
    • D. Cossock and T. Zhang, "Subset ranking using regression," in COLT, 2006, pp. 605-619.
    • (2006) COLT , pp. 605-619
    • Cossock, D.1    Zhang, T.2
  • 7
    • 84856670612 scopus 로고    scopus 로고
    • Relative attributes
    • D. Parikh and K. Grauman, "Relative attributes," in ICCV, 2011, pp. 503-510.
    • (2011) ICCV , pp. 503-510
    • Parikh, D.1    Grauman, K.2
  • 13
    • 68949137209 scopus 로고    scopus 로고
    • University of Wisconsin-Madison, Computer Sciences Technical Report 1648
    • B. Settles, "Active learning literature survey," University of Wisconsin-Madison, Computer Sciences Technical Report 1648, 2009.
    • (2009) Active Learning Literature Survey
    • Settles, B.1
  • 16
    • 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 Proc. of 30th ACM Symposium on Theory of Computing, 1998, pp. 604-613.
    • (1998) Proc. of 30th ACM Symposium on Theory of Computing , pp. 604-613
    • Indyk, P.1    Motwani, R.2
  • 20
    • 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 Proc. of IEEE CVPR, 2011, pp. 817-824.
    • (2011) Proc. of IEEE CVPR , pp. 817-824
    • Gong, Y.1    Lazebnik, S.2
  • 21
    • 84858740468 scopus 로고    scopus 로고
    • Learning to hash with binary reconstructive embeddings
    • Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, Eds
    • B. Kulis and T. Darrell, "Learning to Hash with Binary Reconstructive Embeddings," in Proc. of Advances in Neural Information Processing Systems, Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, and A. Culotta, Eds., 2009, vol. 20, pp. 1042-1050.
    • (2009) Proc. of Advances in Neural Information Processing Systems , vol.20 , pp. 1042-1050
    • Kulis, B.1    Darrell, T.2


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