{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:19:27Z","timestamp":1775283567153,"version":"3.50.1"},"reference-count":61,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:p>Machine-learned ranking functions have shown successes in Web search engines. With the increasing demands on developing effective ranking functions for different search domains, we have seen a big bottleneck, that is, the problem of insufficient labeled training data, which has significantly slowed the development and deployment of machine-learned ranking functions for different domains. There are two possible approaches to address this problem: (1) combining labeled training data from similar domains with the small target-domain labeled data for training or (2) using pairwise preference data extracted from user clickthrough log for the target domain for training. In this article, we propose a new approach called tree-based ranking function adaptation (Trada) to effectively utilize these data sources for training cross-domain ranking functions. Tree adaptation assumes that ranking functions are trained with the Stochastic Gradient Boosting Trees method\u2014a gradient boosting method on regression trees. It takes such a ranking function from one domain and tunes its tree-based structure with a small amount of training data from the target domain. The unique features include (1) automatic identification of the part of the model that needs adjustment for the new domain and (2) appropriate weighing of training examples considering both local and global distributions. Based on a novel pairwise loss function that we developed for pairwise learning, the basic tree adaptation algorithm is also extended (Pairwise Trada) to utilize the pairwise preference data from the target domain to further improve the effectiveness of adaptation. Experiments are performed on real datasets to show that tree adaptation can provide better-quality ranking functions for a new domain than other methods.<\/jats:p>","DOI":"10.1145\/2037661.2037663","type":"journal-article","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T19:05:23Z","timestamp":1323198323000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Ranking function adaptation with boosting trees"],"prefix":"10.1145","volume":"29","author":[{"given":"Keke","family":"Chen","sequence":"first","affiliation":[{"name":"Wright State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Bai","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaohui","family":"Zheng","sequence":"additional","affiliation":[{"name":"Yahoo! Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,12,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148177"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1046920.1194905"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems 19","author":"Argyriou A.","unstructured":"Argyriou , A. , Evgeniou , T. , and Pontil , M . 2007. Multi-task feature learning . In Proceedings of the Conference on Advances in Neural Information Processing Systems 19 . MIT Press, Cambridge, MA. Argyriou, A., Evgeniou, T., and Pontil, M. 2007. Multi-task feature learning. In Proceedings of the Conference on Advances in Neural Information Processing Systems 19. MIT Press, Cambridge, MA."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP).","author":"Bacchiani M.","unstructured":"Bacchiani , M. and Roark , B . 2003. Unsupervised language model adaptation . In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP). Bacchiani, M. and Roark, B. 2003. Unsupervised language model adaptation. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)."},{"key":"e_1_2_1_5_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R.","unstructured":"Baeza-Yates , R. and Ribeiro-Neto , B. 1999. Modern Information Retrieval . Addison Wesley , NY. Baeza-Yates, R. and Ribeiro-Neto, B. 1999. Modern Information Retrieval. Addison Wesley, NY."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). MIT Press","author":"Ben-David S.","unstructured":"Ben-David , S. , Blitzer , J. , Crammer , K. , and Sokolova , P. M . 2007. Analysis of representations for domain adaptation . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). MIT Press , Cambridge, MA. Ben-David, S., Blitzer, J., Crammer, K., and Sokolova, P. M. 2007. Analysis of representations for domain adaptation. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). MIT Press, Cambridge, MA."},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). MIT Press","author":"Blitzer J.","unstructured":"Blitzer , J. , Crammer , K. , Kulesza , A. , Pereira , O. , and Wortman , J . 2008. Learning bounds for domain adaptation . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). MIT Press , Cambridge, MA. Blitzer, J., Crammer, K., Kulesza, A., Pereira, O., and Wortman, J. 2008. Learning bounds for domain adaptation. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). MIT Press, Cambridge, MA."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the Conference on Empirical Methods in Natural Language Processing.","author":"Blitzer J.","unstructured":"Blitzer , J. , McDonald , R. , and Pereira , F . 2006. Domain adaptation with structural correspondence learning . In Proceedings of the Conference on Empirical Methods in Natural Language Processing. Blitzer, J., McDonald, R., and Pereira, F. 2006. Domain adaptation with structural correspondence learning. In Proceedings of the Conference on Empirical Methods in Natural Language Processing."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS).","author":"Burges C.","unstructured":"Burges , C. , Le , Q. , and Ragno , R . 2006. Learning to rank with nonsmooth cost functions . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). Burges, C., Le, Q., and Ragno, R. 2006. Learning to rank with nonsmooth cost functions. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_2_1_11_1","unstructured":"Burges C. J. 2010. From ranknet to lambdarank to lambdamart: An overview. Micro. Res. Tech. rep. MSR-TR-2010-82. Burges C. J. 2010. From ranknet to lambdarank to lambdamart: An overview. Micro. Res. Tech. rep. MSR-TR-2010-82."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.","author":"Cao Y.","unstructured":"Cao , Y. , Xu , J. , Liu , T.-Y. , Huang , Y. , and Hon , H . -W. 2006. Adapting ranking svm to document retrieval . In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Cao, Y., Xu, J., Liu, T.-Y., Huang, Y., and Hon, H.-W. 2006. Adapting ranking svm to document retrieval. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526711"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458233"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_44"},{"key":"e_1_2_1_17_1","volume-title":"An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods","author":"Cristianini N.","unstructured":"Cristianini , N. and Shawe-Taylor , J. 2000. An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods . Cambridge University Press , UK. Cristianini, N. and Shawe-Taylor, J. 2000. An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods. Cambridge University Press, UK."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273521"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390182"},{"key":"e_1_2_1_20_1","first-page":"1817","article-title":"Domain adaptation for statistical classifiers","volume":"16","author":"Daum\u00e9 III, H","year":"2006","unstructured":"Daum\u00e9 III, H . and Marcu , D. 2006 . Domain adaptation for statistical classifiers . J. Mach. Learn. Res. 16 , 1817 -- 1853 . Daum\u00e9 III, H. and Marcu, D. 2006. Domain adaptation for statistical classifiers. J. Mach. Learn. Res. 16, 1817--1853.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics","author":"Dong A.","unstructured":"Dong , A. , Chang , Y. , Ji , S. , Liao , C. , Li , X. , and Zheng , Z . 2009. Empirical exploitation of click data for task specific ranking . In Proceedings of the Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics , Morristown, NJ, 1086--1095. Dong, A., Chang, Y., Ji, S., Liao, C., Li, X., and Zheng, Z. 2009. Empirical exploitation of click data for task specific ranking. In Proceedings of the Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, Morristown, NJ, 1086--1095."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014067"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442794"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/945365.964285"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 16th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, 1401--1406","author":"Freund Y.","unstructured":"Freund , Y. and Schapire , R. E . 1999. A short introduction to boosting . In Proceedings of the 16th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, 1401--1406 . Freund, Y. and Schapire, R. E. 1999. A short introduction to boosting. In Proceedings of the 16th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, 1401--1406."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_2_1_27_1","first-page":"4305","article-title":"Importance sampled learning ensembles","volume":"9","author":"Friedman J. H.","year":"2003","unstructured":"Friedman , J. H. and Popescu , B. E. 2003 . Importance sampled learning ensembles . J. Mach. Learn. Res. 9 , 4305 . Friedman, J. H. and Popescu, B. E. 2003. Importance sampled learning ensembles. J. Mach. Learn. Res. 9, 4305.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics","author":"Gao J.","unstructured":"Gao , J. , Wu , Q. , Burges , C. , Svore , K. , Su , Y. , Khan , N. , Shah , S. , and Zhou , H . 2009. Model adaptation via model interpolation and boosting for web search ranking . In Proceedings of the Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics , Singapore, 505--513. Gao, J., Wu, Q., Burges, C., Svore, K., Su, Y., Khan, N., Shah, S., and Zhou, H. 2009. Model adaptation via model interpolation and boosting for web search ranking. In Proceedings of the Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, Singapore, 505--513."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1645980"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of Yahoo! Learning to Rank Challenge Workshop in ICML.","author":"Geurts P.","year":"2010","unstructured":"Geurts , P. 2010 . Learning to rank with extremely randomized regression trees . In Proceedings of Yahoo! Learning to Rank Challenge Workshop in ICML. Geurts, P. 2010. Learning to rank with extremely randomized regression trees. In Proceedings of Yahoo! Learning to Rank Challenge Workshop in ICML."},{"key":"e_1_2_1_31_1","volume-title":"Yetirank: Everybody lies. In Yahoo! Learning to Rank Challenge Workshop in ICML.","author":"Gulin A.","year":"2010","unstructured":"Gulin , A. and Kuralenok , I . 2010 . Yetirank: Everybody lies. In Yahoo! Learning to Rank Challenge Workshop in ICML. Gulin, A. and Kuralenok, I. 2010. Yetirank: Everybody lies. In Yahoo! Learning to Rank Challenge Workshop in ICML."},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Hastie T. Tibshirani R. and Friedman J. 2001. The Elements of Statistical Learning. Springer-Verlag. Hastie T. Tibshirani R. and Friedman J. 2001. The Elements of Statistical Learning. Springer-Verlag.","DOI":"10.1007\/978-0-387-21606-5"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Herbrich R. Graepel T. and Obermayer K. 2000. Large margin rank boundaries for ordinal regression. Adv. Large Marg. Class. 115--132. Herbrich R. Graepel T. and Obermayer K. 2000. Large margin rank boundaries for ordinal regression. Adv. Large Marg. Class. 115--132.","DOI":"10.7551\/mitpress\/1113.003.0010"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.3115\/1034678.1034699"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571950"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the Conference of the Association for Computational Linguistics.","author":"Jiang J.","unstructured":"Jiang , J. and Zhai , C . 2007. Instance weighting for domain adaptation in NLP . In Proceedings of the Conference of the Association for Computational Linguistics. Jiang, J. and Zhai, C. 2007. Instance weighting for domain adaptation in NLP. In Proceedings of the Conference of the Association for Computational Linguistics."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of Eurospeech.","author":"Leggetter C.","unstructured":"Leggetter , C. and Woodland , P . 1995. Flexible speaker adaptation using maximum likelihood linear regression . In Proceedings of Eurospeech. Leggetter, C. and Woodland, P. 1995. Flexible speaker adaptation using maximum likelihood linear regression. In Proceedings of Eurospeech."},{"key":"e_1_2_1_41_1","unstructured":"Lehmann E. L. and Casella G. 1998. Theory of Point Estimation. Springer-Verlag. Lehmann E. L. and Casella G. 1998. Theory of Point Estimation. Springer-Verlag."},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS).","author":"Li P.","unstructured":"Li , P. , Burges , C. J. , and Wu , Q . 2007. Mcrank: Learning to rank using multiple classification and gradient boosting . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). Li, P., Burges, C. J., and Wu, Q. 2007. Mcrank: Learning to rank using multiple classification and gradient boosting. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102415"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646123"},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS).","author":"Mansour Y.","unstructured":"Mansour , Y. , Mohri , M. , and Rostamizadeh , A . 2009. Domain adaptation: Learning bounds and algorithms . In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). Mansour, Y., Mohri, M., and Rostamizadeh, A. 2009. Domain adaptation: Learning bounds and algorithms. In Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS)."},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of Yahoo! Learning to Rank Challenge Workshop in ICML.","author":"Mohan A.","unstructured":"Mohan , A. , Chen , Z. , and Weinberger , K . 2010. Tree ensemble and transfer learning . In Proceedings of Yahoo! Learning to Rank Challenge Workshop in ICML. Mohan, A., Chen, Z., and Weinberger, K. 2010. Tree ensemble and transfer learning. In Proceedings of Yahoo! Learning to Rank Challenge Workshop in ICML."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009006"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.191"},{"key":"e_1_2_1_49_1","volume-title":"Proceedings of Yahoo! Learning to Rank Challenge Workshop in ICML.","author":"Pavlov D.","unstructured":"Pavlov , D. and Brunk , C . 2010. Bagboo: Bagging the gradient boosting . In Proceedings of Yahoo! Learning to Rank Challenge Workshop in ICML. Pavlov, D. and Brunk, C. 2010. Bagboo: Bagging the gradient boosting. In Proceedings of Yahoo! Learning to Rank Challenge Workshop in ICML."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273592"},{"key":"e_1_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Schapire R. E. 2003. The boosting approach to machine learning: An overview. Nonlinear Estimation and Classification. Schapire R. E. 2003. The boosting approach to machine learning: An overview. Nonlinear Estimation and Classification.","DOI":"10.1007\/978-0-387-21579-2_9"},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of Yahoo! Learning to Rank Challenge Workshop in ICML.","author":"Sorokina D.","year":"2010","unstructured":"Sorokina , D. 2010 . Application of additive groves to the learning to rank challenge . In Proceedings of Yahoo! Learning to Rank Challenge Workshop in ICML. Sorokina, D. 2010. Application of additive groves to the learning to rank challenge. In Proceedings of Yahoo! Learning to Rank Challenge Workshop in ICML."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277808"},{"key":"e_1_2_1_54_1","volume-title":"The Nature of Statistical Learning Theory","author":"Vapnik V. N.","unstructured":"Vapnik , V. N. 1999. The Nature of Statistical Learning Theory . Springer Science and Business Media , LLC , Berlin, Germany. Vapnik, V. N. 1999. The Nature of Statistical Learning Theory. Springer Science and Business Media, LLC, Berlin, Germany."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/3121525.3121562"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015436"},{"key":"e_1_2_1_57_1","unstructured":"Wu Q. Burges C. J. Svore K. and Gao J. 2008. Ranking boosting and model adaptation. Micro. Res. Tech. rep. Microsoft. Wu Q. Burges C. J. Svore K. and Gao J. 2008. Ranking boosting and model adaptation. Micro. Res. Tech. rep. Microsoft."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9112-1"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277792"},{"key":"e_1_2_1_61_1","volume-title":"Proceedings of Neural Information Processing Systems (NIPS).","author":"Zheng Z.","unstructured":"Zheng , Z. , Zha , H. , Zhang , T. , Chapelle , O. , Chen , K. , and Sun , G . 2007b. A general boosting method and its application to learning ranking functions for web search . In Proceedings of Neural Information Processing Systems (NIPS). Zheng, Z., Zha, H., Zhang, T., Chapelle, O., Chen, K., and Sun, G. 2007b. A general boosting method and its application to learning ranking functions for web search. In Proceedings of Neural Information Processing Systems (NIPS)."}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2037661.2037663","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2037661.2037663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:28Z","timestamp":1750240468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2037661.2037663"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":61,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1145\/2037661.2037663"],"URL":"https:\/\/doi.org\/10.1145\/2037661.2037663","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]},"assertion":[{"value":"2010-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-12-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}