메뉴 건너뛰기




Volumn , Issue , 2011, Pages

Boosting with maximum adaptive sampling

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; ECONOMIC AND SOCIAL EFFECTS; ITERATIVE METHODS; OBJECT RECOGNITION;

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

References (10)
  • 1
    • 0036568025 scopus 로고    scopus 로고
    • Finite-time analysis of the multiarmed bandit problem
    • P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2):235-256, 2002.
    • (2002) Machine Learning , vol.47 , Issue.2 , pp. 235-256
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3
  • 3
    • 77956544717 scopus 로고    scopus 로고
    • Accelerating AdaBoost using UCB
    • Jan
    • R. Busa-Fekete and B. Kegl. Accelerating AdaBoost using UCB. JMLR W&CP, Jan 2009.
    • (2009) JMLR W&CP
    • Busa-Fekete, R.1    Kegl, B.2
  • 4
    • 77956554273 scopus 로고    scopus 로고
    • Fast Boosting using adversarial bandits
    • R. Busa-Fekete and B. Kegl. Fast Boosting using adversarial bandits. In ICML, 2010.
    • (2010) ICML
    • Busa-Fekete, R.1    Kegl, B.2
  • 5
    • 37049036831 scopus 로고    scopus 로고
    • Priority sampling for estimation of arbitrary subset sums
    • December
    • N. Duffield, C. Lund, and M. Thorup. Priority sampling for estimation of arbitrary subset sums. J. ACM, 54, December 2007.
    • (2007) J. ACM , vol.54
    • Duffield, N.1    Lund, C.2    Thorup, M.3


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