메뉴 건너뛰기




Volumn , Issue , 2009, Pages 505-513

Model adaptation via model interpolation and boosting for Web search ranking

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL; INTERPOLATION; NATURAL LANGUAGE PROCESSING SYSTEMS; TESTING; WEBSITES;

EID: 77956206577     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1699571.1699578     Document Type: Conference Paper
Times cited : (30)

References (21)
  • 1
    • 78049406407 scopus 로고    scopus 로고
    • Language model adaptation with MAP estimation and the Perceptron algorithm
    • Bacchiani, M., Roark, B. and Saraclar, M. 2004. Language model adaptation with MAP estimation and the Perceptron algorithm. In HLT-NAACL, 21-24.
    • (2004) HLT-NAACL , pp. 21-24
    • Bacchiani, M.1    Roark, B.2    Saraclar, M.3
  • 2
    • 0346008165 scopus 로고    scopus 로고
    • Statistical language model adaptation: Review and perspectives
    • Bellegarda, J. R. 2004. Statistical language model adaptation: review and perspectives. Speech Communication, 42: 93-108.
    • (2004) Speech Communication , vol.42 , pp. 93-108
    • Bellegarda, J.R.1
  • 3
    • 0035478854 scopus 로고    scopus 로고
    • Random forests
    • Breiman, L. 2001. Random forests. Machine Learning, 45, 5-23.
    • (2001) Machine Learning , vol.45 , pp. 5-23
    • Breiman, L.1
  • 4
    • 0001740650 scopus 로고
    • Training with noise is equivalent to Tikhonov regularization
    • Bishop, C.M. 1995. Training with noise is equivalent to Tikhonov regularization. Neural Computation, 7, 108-116.
    • (1995) Neural Computation , vol.7 , pp. 108-116
    • Bishop, C.M.1
  • 5
    • 80053427707 scopus 로고    scopus 로고
    • Learning to rank with nonsmooth cost functions
    • Burges, C. J., Ragno, R., & Le, Q. V. 2006. Learning to rank with nonsmooth cost functions. In ICML.
    • (2006) ICML
    • Burges, C.J.1    Ragno, R.2    Le, Q.V.3
  • 7
    • 0031189914 scopus 로고    scopus 로고
    • Multitask learning
    • Caruana, R. 1997. Multitask learning. Machine Learning, 28(1): 41-70.
    • (1997) Machine Learning , vol.28 , Issue.1 , pp. 41-70
    • Caruana, R.1
  • 8
    • 26444551655 scopus 로고    scopus 로고
    • Discriminative reranking for natural language parsing
    • Collins, M. 2000. Discriminative reranking for natural language parsing. In ICML.
    • (2000) ICML
    • Collins, M.1
  • 10
    • 0003743417 scopus 로고    scopus 로고
    • Stochastic gradient boosting
    • Dept. Statistics, Stanford
    • Friedman, J. 1999. Stochastic gradient boosting. Technical report, Dept. Statistics, Stanford.
    • (1999) Technical Report
    • Friedman, J.1
  • 11
    • 0035470889 scopus 로고    scopus 로고
    • Greedy function approximation: A gradient boosting machine
    • Friedman, J. 2001. Greedy function approximation: a gradient boosting machine. Annals of Statistics, 29(5).
    • (2001) Annals of Statistics , vol.29 , Issue.5
    • Friedman, J.1
  • 12
    • 33746644577 scopus 로고    scopus 로고
    • Linear discriminative models for information retrieval
    • Gao, J., Qin, H., Xia, X. and Nie, J-Y. 2005. Linear discriminative models for information retrieval. In SIGIR.
    • (2005) SIGIR
    • Gao, J.1    Qin, H.2    Xia, X.3    Nie, J.-Y.4
  • 15
    • 0033645041 scopus 로고    scopus 로고
    • IR evaluation methods for retrieving highly relevant documents
    • Jarvelin, K. and Kekalainen, J. 2000. IR evaluation methods for retrieving highly relevant documents. In SIGIR.
    • (2000) SIGIR
    • Jarvelin, K.1    Kekalainen, J.2
  • 16
    • 84885665252 scopus 로고    scopus 로고
    • Accurately interpreting clickthrough data as implicit feedback
    • Joachims, T., Granka, L., Pan, B., Hembrooke, H. and Gay, G. 2005. Accurately interpreting clickthrough data as implicit feedback. In SIGIR.
    • (2005) SIGIR
    • Joachims, T.1    Granka, L.2    Pan, B.3    Hembrooke, H.4    Gay, G.5
  • 19
    • 67650085898 scopus 로고    scopus 로고
    • How does clickthrough data reflect retrieval quality?
    • Radlinski, F., Kurup, M. and Joachims, T. 2008. How does clickthrough data reflect retrieval quality? In CIKM.
    • (2008) CIKM
    • Radlinski, F.1    Kurup, M.2    Joachims, T.3
  • 20
    • 0041494227 scopus 로고    scopus 로고
    • Is learning the n-th thing any easier than learning the first
    • Thrun, S. 1996. Is learning the n-th thing any easier than learning the first. In NIPS.
    • (1996) NIPS
    • Thrun, S.1


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