메뉴 건너뛰기




Volumn , Issue , 2009, Pages 17-24

Online models for content optimization

Author keywords

[No Author keywords available]

Indexed keywords

'CURRENT; CLICKTHROUGH RATES (CTR); CONTENT PUBLISHING; DYNAMIC CONTENT; NONSTATIONARY; ON-LINE MODELLING; OPTIMISATIONS; PUBLISHING SYSTEMS; TRAFFIC VOLUMES; USER SEGMENT;

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

References (14)
  • 8
    • 0036568025 scopus 로고    scopus 로고
    • Finite-time analysis of the multiarmed bandit problem
    • DOI 10.1023/A:1013689704352, Computational Learning Theory
    • P.Auer, N.Cesa-Bianchi, and P.Fischer. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47:235-256, 2002. (Pubitemid 34126111)
    • (2002) Machine Learning , vol.47 , Issue.2-3 , pp. 235-256
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3
  • 13
    • 85162014718 scopus 로고    scopus 로고
    • Google news personalization:scalable online collaborative filtering
    • S.Das, D.Data, and A.Garg. Google news personalization:scalable online collaborative filtering. InWWW, Banff, Alberta, Canada, 2007.
    • (2007) WWW, Banff, Alberta, Canada
    • Das, S.1    Data, D.2    Garg, A.3
  • 14
    • 0002899547 scopus 로고
    • Asymptotically efficient adaptive allocation rules
    • T.Lai and H.Robbins. Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6:4-22, 1985.
    • (1985) Advances in Applied Mathematics , vol.6 , pp. 4-22
    • Lai, T.1    Robbins, H.2


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