{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:57:40Z","timestamp":1768424260075,"version":"3.49.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2015,1,23]],"date-time":"2015-01-23T00:00:00Z","timestamp":1421971200000},"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. Web"],"published-print":{"date-parts":[[2015,1,23]]},"abstract":"<jats:p>Learning to rank has become increasingly important for many information retrieval applications. To reduce the labeling cost at training data preparation, many active sampling algorithms have been proposed. In this article, we propose a novel active learning-for-ranking strategy called ranking-based sensitivity sampling (RSS), which is tailored for Gradient Boosting Decision Tree (GBDT), a machine-learned ranking method widely used in practice by major commercial search engines for ranking. We leverage the property of GBDT that samples close to the decision boundary tend to be sensitive to perturbations and design the active learning strategy accordingly. We further theoretically analyze the proposed strategy by exploring the connection between the sensitivity used for sample selection and model regularization to provide a potentially theoretical guarantee w.r.t. the generalization capability. Considering that the performance metrics of ranking overweight the top-ranked items, item rank is incorporated into the selection function. In addition, we generalize the proposed technique to several other base learners to show its potential applicability in a wide variety of applications. Substantial experimental results on both the benchmark dataset and a real-world dataset have demonstrated that our proposed active learning strategy is highly effective in selecting the most informative examples.<\/jats:p>","DOI":"10.1145\/2697391","type":"journal-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T14:05:51Z","timestamp":1422453951000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Active Learning for Web Search Ranking via Noise Injection"],"prefix":"10.1145","volume":"9","author":[{"given":"Wenbin","family":"Cai","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"given":"Muhan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"given":"Ya","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2015,1,23]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 15th International Conference on Machine Learning (ICML\u201998)","author":"Abe N."},{"key":"e_1_2_1_2_1","unstructured":"N. Ailon. 2011. Active learning ranking from pairwise preferences with almost optimal query complexity. In Advances in Neural Information Processing Systems (NIPS\u201911). 810--818. N. Ailon. 2011. Active learning ranking from pairwise preferences with almost optimal query complexity. In Advances in Neural Information Processing Systems (NIPS\u201911). 810--818."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572022"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348455"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1995.7.1.108"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009935"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398522"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148205"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835953"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5231-6"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"D. A. Chon Z. Ghahramani and M. I. Jordan. 1996. Active learning with statistical models. Journal of Machine Learning Research (1996) 129--145. D. A. Chon Z. Ghahramani and M. I. Jordan. 1996. Active learning with statistical models. Journal of Machine Learning Research (1996) 129--145.","DOI":"10.1613\/jair.295"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_44"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390188"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/945365.964285"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007330508534"},{"key":"e_1_2_1_16_1","volume-title":"Greedy function approximation: A gradient boosting machine. Annals of Statistics","author":"Friedman J.","year":"2001"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"T. Hastie R. Tibshirani and J. Friedman. 2001. The Elements of Statistical Learning. Springer. T. Hastie R. Tibshirani and J. Friedman. 2001. The Elements of Statistical Learning. Springer.","DOI":"10.1007\/978-0-387-21606-5"},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"R. Herbrich T. Graepel and K. Obermayer. 2000. Large margin rank boundaries for ordinal regression. In Advances in Large Margin Classifiers. MIT Press. R. Herbrich T. Graepel and K. Obermayer. 2000. Large margin rank boundaries for ordinal regression. In Advances in Large Margin Classifiers. MIT Press.","DOI":"10.7551\/mitpress\/1113.003.0010"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR\u201994)","author":"Lewis D. D."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of SIGIR 2007 Workshop on Learning to Rank for Information Retrieval.","author":"Liu T. Y."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835495"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/21.155944"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015349"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 13th International Conference on Data Mining (ICDM\u201913)","author":"Qian B."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 18th International Conference on Machine Learning (ICML\u201901)","author":"Roy N."},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"B. Settles. 2012. Active Learning. Morgan & Claypool. B. Settles. 2012. Active Learning. Morgan & Claypool.","DOI":"10.1007\/978-3-031-01560-1"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414425.2414431"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of European Conference on Machine Learning and Principles and Practise of Knowlege Discovery in Databases (ECML-PKDD\u201911)","author":"Silva R."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341544"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244302760185243"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1005332.1016783"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572112"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572066"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081911"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277790"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753783.1753784"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASL.2009.2033421"}],"container-title":["ACM Transactions on the Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2697391","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2697391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:11Z","timestamp":1750227131000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2697391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,23]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1,23]]}},"alternative-id":["10.1145\/2697391"],"URL":"https:\/\/doi.org\/10.1145\/2697391","relation":{},"ISSN":["1559-1131","1559-114X"],"issn-type":[{"value":"1559-1131","type":"print"},{"value":"1559-114X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,23]]},"assertion":[{"value":"2014-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}