A general boosting method and its application to learning ranking functions for Web search

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Zheng, Zhaohui ^a   Zha, Hongyuan ^b   Zhang, Tong ^a   Chapelle, Olivier ^a   Chen, Keke ^a   Sun, Gordon ^a  

^a YAHOO INC   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BOOSTING; INFORMATION RETRIEVAL; LEARNING SYSTEMS; WEBSITES;

BOOSTING METHOD; FUNCTIONAL GRADIENT; GRADIENT BOOSTING; ITS APPLICATIONS; LOSS FUNCTIONS; MACHINE LEARNING PROBLEM; OPTIMISATIONS; RANKING FUNCTIONS; UPPER BOUND; WEB SEARCHES;

SEARCH ENGINES;

EID: 85161963897     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. BALCAN N., BEYGELZIMER A., LANGFORD J., AND SORKIN G. Robust Reductions from Ranking to Classification, manuscript, 2007.
2. BERTSEKAS D. Nonlinear programming. Athena Scientific, second edition, 1999.
3. BURGES, C., SHAKED, T., RENSHAW, E., LAZIER, A., DEEDS, M., HAMILTON, N., AND HULLENDER, G. Learning to rank using gradient descent. Proc. of Intl. Conf. on Machine Learning (ICML) (2005).
4. DIETTERICH, T. G., ASHENFELTER, A., BULATOV, Y. Training Conditional Random Fields via Gradient Tree Boosting Proc. of Intl. Conf. on Machine Learning (ICML) (2004).
5. CLEMENCON S., LUGOSI G., AND VAYATIS N. Ranking and scoring using empirical risk minimization. Proc. of COLT (2005).
6. COHEN, W. W., SCHAPIRE, R. E., AND SINGER, Y. Learning to order things. Journal of Artificial Intelligence Research, Neural Computation, 13, 14431472 (1999).
7. FREUND, Y., IYER, R., SCHAPIRE, R. E., AND SINGER, Y. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research 4 (2003), 933-969.
8. FRIEDMAN, J. H. Greedy function approximation: A gradient boosting machine. Annals of Statistics 29, 5 (2001), 1189-1232. (Pubitemid 33405972)
9. HERBRICH, R., GRAEPEL, T., AND OBERMAYER, K. Large margin rank boundaries for ordinal regression. 115-132.
10. JARVELIN, K., AND KEKALAINEN, J. Ir evaluation methods for retrieving highly relevant documents. Proc. of ACM SIGIR Conference (2000).
11. JOACHIMS, T. Optimizing search engines using clickthrough data. Proc. of ACM SIGKDD Conference (2002).
12. JOACHIMS, T., GRANKA, L., PAN, B., AND GAY, G. Accurately interpreting clickthough data as implicit feedback. Proc. of ACM SIGIR Conference (2005).
13. TSOCHANTARIDIS, I., JOACHIMS, T., HOFMANN, T., AND ALTUN, Y. Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research, 6:1453-1484, 2005.