Large-scale learning to rank using boosted decision trees

Scaling up Machine Learning: Parallel and Distributed Approaches

Volumn 9780521192248, Issue , 2011, Pages 148-169

  Svore, Krysta M ^a   Burges, Christopher J C ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; DECISION TREES; DISTRIBUTED COMPUTER SYSTEMS; EDUCATION; INFORMATION RETRIEVAL; SCHEDULING ALGORITHMS; WEBSITES;

BOOSTED DECISION TREES; DATA DISTRIBUTION; LARGE-SCALE LEARNING; LEARNING TO RANK; MEMORY CONSTRAINTS; RANKING ALGORITHM; TRAINING METHODS; WEB SEARCH RANKINGS;

TREES (MATHEMATICS);

EID: 84923442411     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9781139042918.009     Document Type: Chapter

References (19)

1. Banko, M., and Brill, E. 2001. Scaling to Very Very Large Corpora for Natural Language Disambiguation. Pages 26-33 of: Association for Computational Linguistics (ACL).
2. Burges, C. J., Svore, K. M., Benett, P. N., Pastusiak, A., and Wu, Q. 2011. Learning to Rank Using an Ensemble of Lambda-Gradient Models. Special Edition of JMLR: Proceedings of the Yahoo! Learning to Rank Challenge, 14, 25-35.
3. Burges, C. J. C. 2010. From RankNet to LambdaRank to LambdaMART: An Overview. Technical Report MSR-TR-2010-82. Microsoft Research.
4. Burges, C. J. C., Ragno, R., and Le, Q. V. 2006. Learning to Rank with Non-Smooth Cost Functions. In: Advances in Neural Information Processing Systems (NIPS).
5. Caragea, D., Silvescu, A., and Honavar, V. 2004. A Framework for Learning from Distributed Data using Sufficient Statistics and Its Application to Learning Decision Trees. International Journal of Hybrid Intelligent Systems, 1(1-2), 80-89.
6. Dean, J., and Ghemawat, S. 2004. MapReduce: Simplified Data Processing on Large Clusters. In: Symposium on Operating System Design and Implementation (OSDI).
7. Domingos, P., and Hulten, G. 2000. Mining High-Speed Data Streams. Pages 71-80 of: SIGKDD Conference on Knowledge and Data Mining (KDD).
8. Domingos, P., and Hulten, G. 2001. A General Method for Scaling UpMachine Learning Algorithms and its Application to Clustering. In: International Conference on Machine Learning (ICML).
9. Donmez, P., Svore, K., and Burges, C. J. C. 2009. On the Local Optimality of LambdaRank. In: ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR).
10. Fan, W., Stolfo, S., and Zhang, J. 1999. The Application of AdaBoost for Distributed, Scalable and Online Learning. Pages 362-366 of: SIGKDD Conference on Knowledge and Data Mining (KDD).
11. Friedman, J. 2001. Greedy Function Approximation: A Gradient BoostingMachine. Annals of Statistics, 25(5), 1189-1232.
12. Jarvelin, K., and Kekalainen, J. 2000. IR Evaluation Methods for Retrieving Highly Relevant Documents. Pages 41-48 of: ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR).
13. Lazarevic, A. 2001. The distributed boosting algorithm. Pages 311-316 of: SIGKDD Conference on Knowledge Discovery and Data Mining (KDD).
14. Lazarevic, A., and Obradovic, Z. 2002. Boosting Algorithms for Parallel and Distributed Learning. Distributed and Parallel Databases, 11, 203-229.
15. Panda, B., Herbach, J. S., Basu, S., and Bayardo, R. J. 2009. PLANET: Massively Parallel Learning of Tree Ensembles with MapReduce. In: International Conference on Very Large Databases (VLDB).
16. Provost, F., and Fayyad, U. 1999. A Survey of Methods for Scaling Up Induction Algorithms. Data Mining and Knowledge Discovery, 3, 131-169.
17. van Uyen, N. T., and Chung, T. 2007. A New Framework for Distributed Boosting Algorithm. Pages 420-423 of: Future Generation Communication and Networking (FGCN).
18. Wu, Q., Burges, C. J. C., Svore, K. M., and Gao, J. 2010. Adapting Boosting for Information Retrieval Measures. Journal of Information Retrieval, 13(3), 254-270.
19. Yahoo! Learning to Rank Challenge. 2010. http://learningtorankchallenge.yahoo.com/.