{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T22:50:16Z","timestamp":1761519016197},"reference-count":36,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1016\/j.patrec.2011.09.020","type":"journal-article","created":{"date-parts":[[2011,10,25]],"date-time":"2011-10-25T18:45:20Z","timestamp":1319568320000},"page":"173-181","source":"Crossref","is-referenced-by-count":6,"title":["Multi-task learning to rank for web search"],"prefix":"10.1016","volume":"33","author":[{"given":"Yi","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gui-Rong","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyuan","family":"Zha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaohui","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.patrec.2011.09.020_b0005","doi-asserted-by":"crossref","unstructured":"Amini, M.R., Truong, T.-V., Goutte, C., 2008. A boosting algorithm for learning bipartite ranking functions with partially labeled data. In: Proc. 31st Annual Internat. ACM SIGIR Conf. on Research and Development in Information Retrieval.","DOI":"10.1145\/1390334.1390354"},{"key":"10.1016\/j.patrec.2011.09.020_b0010","article-title":"Multi-task feature learning","volume":"19","author":"Argyriou","year":"2007","journal-title":"Neural Inform. Process. Systems"},{"key":"10.1016\/j.patrec.2011.09.020_b0015","doi-asserted-by":"crossref","unstructured":"Bai, J., Zhou, K., Xue, G.-R., Zha, H., Zheng, Z., and Chang, Y., 2009. Multi-task learning for learning to rank in web search. In: Proc. 18th ACM Conf. on Information and Knowledge Management.","DOI":"10.1145\/1645953.1646169"},{"key":"10.1016\/j.patrec.2011.09.020_b0020","first-page":"83","article-title":"Task clustering and gating for bayesian multitask learning","volume":"4","author":"Bakker","year":"2003","journal-title":"J. Machine Learn. Res."},{"issue":"1","key":"10.1016\/j.patrec.2011.09.020_b0025","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1007327622663","article-title":"A bayesian\/information theoretic model of learning to learn via multiple task sampling","volume":"28","author":"Baxter","year":"1997","journal-title":"Machine Learn."},{"key":"10.1016\/j.patrec.2011.09.020_b0030","doi-asserted-by":"crossref","unstructured":"Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., Hullender. G., 2005. Learning to rank using gradient descent. In: Proc. 22nd Internat. Conf. on Machine learning.","DOI":"10.1145\/1102351.1102363"},{"key":"10.1016\/j.patrec.2011.09.020_b0035","article-title":"Learning to rank with nonsmooth cost functions","volume":"19","author":"Burges","year":"2007","journal-title":"Neural Inform. Process. Systems"},{"key":"10.1016\/j.patrec.2011.09.020_b0040","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., Li, H., 2007. Learning to rank: From pairwise approach to listwise approach. In: Proc. 24th Internat. Conf. on Machine Learning.","DOI":"10.1145\/1273496.1273513"},{"issue":"1","key":"10.1016\/j.patrec.2011.09.020_b0045","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1007379606734","article-title":"Multitask learning","volume":"28","author":"Caruana","year":"1997","journal-title":"Machine Learn."},{"key":"10.1016\/j.patrec.2011.09.020_b0050","doi-asserted-by":"crossref","unstructured":"Cortes, C., Mohri M., and Rastogi, A., 2007. Magnitude-preserving ranking algorithms. In: Proc. 24th ICML.","DOI":"10.1145\/1273496.1273518"},{"key":"10.1016\/j.patrec.2011.09.020_b0055","doi-asserted-by":"crossref","unstructured":"Duh, K., Kirchhoff, K., 2008. Learning to rank with partially-labeled data. In: Proc. 31st Annual Internat. ACM SIGIR Conf. on Research and Development in Information Retrieval.","DOI":"10.1145\/1390334.1390379"},{"key":"10.1016\/j.patrec.2011.09.020_b0060","doi-asserted-by":"crossref","unstructured":"Evgeniou, T., Pontil, M., 2004. Regularized multi-task learning. In: Proc. tenth ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining, New York, USA, pp. 109\u2013117.","DOI":"10.1145\/1014052.1014067"},{"key":"10.1016\/j.patrec.2011.09.020_b0065","first-page":"615","article-title":"Learning multiple tasks with kernel methods","volume":"6","author":"Evgeniou","year":"2005","journal-title":"J. Machine Learn. Res."},{"key":"10.1016\/j.patrec.2011.09.020_b0070","unstructured":"Fung, G., Rosales, R., Krishnapuram, B., 2006. Learning rankings via convex hull separation. In: Neural Information Processing Systems, vol. 18."},{"key":"10.1016\/j.patrec.2011.09.020_b0075","unstructured":"Freund, Y., Iyer, R.D., Schapire R.E., Singer. Y., 1998. An efficient boosting algorithm for combining preferences. In: Proc. Fifteenth Internat. Conf. on Machine Learning."},{"issue":"5","key":"10.1016\/j.patrec.2011.09.020_b0080","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1214\/aos\/1013203451","article-title":"Greedy function approximation: A gradient boosting machine","volume":"29","author":"Friedman","year":"2001","journal-title":"The Ann. Statist."},{"key":"10.1016\/j.patrec.2011.09.020_b0085","doi-asserted-by":"crossref","unstructured":"Gao, J., Wu, Q., Burges, C., Svore, K., Su, Y., Khan, N., Shah S., Zhou, H., 2009. Model adaptation via model interpolation and boosting for web search ranking. In: Conf. on Empirical Methods in Natural Language Processing.","DOI":"10.3115\/1699571.1699578"},{"key":"10.1016\/j.patrec.2011.09.020_b0090","doi-asserted-by":"crossref","unstructured":"Guiver, J., Snelson, E., 2008. Learning to rank with SoftRank and Gaussian processes. In: Proc. 31st Annual Internat. ACM SIGIR Conf. on Research and Development in Information Retrieval.","DOI":"10.1145\/1390334.1390380"},{"key":"10.1016\/j.patrec.2011.09.020_b0095","unstructured":"Heskes, T., 2000. Empirical Bayes for learning to learn. In: Proc. 17th Internat. Conf. on Machine Learning."},{"key":"10.1016\/j.patrec.2011.09.020_b0100","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/582415.582418","article-title":"Cumulated gain-based evaluation of IR techniques","volume":"20","author":"J\u00e4rvelin","year":"2002","journal-title":"ACM Trans. Inform. Systems"},{"key":"10.1016\/j.patrec.2011.09.020_b0105","doi-asserted-by":"crossref","unstructured":"Joachims, T., 2002. Optimizing search engines using clickthrough data. In: Proc. ACM SIGKDD.","DOI":"10.1145\/775066.775067"},{"key":"10.1016\/j.patrec.2011.09.020_b0110","doi-asserted-by":"crossref","unstructured":"Joachims, T., 2005. A support vector method for multivariate performance measures. In: Proc. 22nd Internat. Conf. on Machine Learning.","DOI":"10.1145\/1102351.1102399"},{"key":"10.1016\/j.patrec.2011.09.020_b0115","doi-asserted-by":"crossref","unstructured":"Lawrence, N.D., Platt, J.C., 2004. Learning to learn with the informative vector machine. In: Proc. 21st Internat. Conf. on Machine Learning.","DOI":"10.1145\/1015330.1015382"},{"key":"10.1016\/j.patrec.2011.09.020_b0120","first-page":"795","article-title":"Radial basis function network for multi-task learning","volume":"vol. 18","author":"Liao","year":"2006"},{"key":"10.1016\/j.patrec.2011.09.020_b0125","series-title":"Learning to Rank for Information Retrieval","author":"Liu","year":"2009"},{"key":"10.1016\/j.patrec.2011.09.020_b0130","unstructured":"Obozinski, G., Taskar B., Jordan. M., 2007. Multi-task Feature Selection. In: UC Berkeley Technical Report."},{"key":"10.1016\/j.patrec.2011.09.020_b0135","doi-asserted-by":"crossref","unstructured":"Xia, F., Liu, T., Wang, J., Zhang, W., Li, H., 2008. Listwise approach to learning to rank: Theory and algorithm. In: Proc. 25th Annual Internat. Conf. Machine.","DOI":"10.1145\/1390156.1390306"},{"key":"10.1016\/j.patrec.2011.09.020_b0140","doi-asserted-by":"crossref","unstructured":"Xu, J., Li, H., 2007. Adarank: A boosting algorithm for information retrieval. In: Proc. 30th ACM SIGIR.","DOI":"10.1145\/1277741.1277809"},{"key":"10.1016\/j.patrec.2011.09.020_b0145","doi-asserted-by":"crossref","unstructured":"Xu, J., Liu, T.Y., Lu, M., Li, H., Ma, W.Y., 2008. Directly optimizing evaluation measures in learning to rank. In: Proc. 31st Annual Internat. ACM SIGIR Conf. on Research and Development in Information Retrieval.","DOI":"10.1145\/1390334.1390355"},{"key":"10.1016\/j.patrec.2011.09.020_b0150","first-page":"35","article-title":"Multi-task learning for classification with dirichlet process priors","volume":"8","author":"Xue","year":"2007","journal-title":"J. Machine Learn. Res."},{"key":"10.1016\/j.patrec.2011.09.020_b0155","doi-asserted-by":"crossref","unstructured":"Yu, K., Tresp, V., Schwaighofer, A., 2005. Learning gaussian processes from multiple tasks. In: Proc. 22nd Internat. Conf. on Machine Learning.","DOI":"10.1145\/1102351.1102479"},{"key":"10.1016\/j.patrec.2011.09.020_b0160","doi-asserted-by":"crossref","unstructured":"Yue, Y., Finley, T., Radlinski, F., Joachims, T., 2007. A support vector method for optimizing average precision. In: Proc. ACM SIGIR.","DOI":"10.1145\/1277741.1277790"},{"key":"10.1016\/j.patrec.2011.09.020_b0165","doi-asserted-by":"crossref","unstructured":"Zha, H., Zheng, Z., Fu, H., and Sun, G., 2006. Incorporating query difference for learning retrieval functions in world wide web search. In: Proc. 15th ACM CIKM Conf., pp. 307\u2013316.","DOI":"10.1145\/1183614.1183660"},{"key":"10.1016\/j.patrec.2011.09.020_b0170","doi-asserted-by":"crossref","first-page":"1538","DOI":"10.1214\/009053605000000255","article-title":"Boosting with early stopping: Convergence and consistency","volume":"33","author":"Zhang","year":"2005","journal-title":"Ann. Statist."},{"key":"10.1016\/j.patrec.2011.09.020_b0175","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Chen, K., Sun, G., Zha, H., 2007. A regression framework for learning ranking functions using relative relevance judgments. In: Proc. 30th ACM SIGIR Conf.","DOI":"10.1145\/1277741.1277792"},{"key":"10.1016\/j.patrec.2011.09.020_b0180","first-page":"1697","article-title":"A general boosting method and its application to learning ranking functions for web search","volume":"vol. 20","author":"Zheng","year":"2008"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865511002935?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865511002935?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T15:52:51Z","timestamp":1560873171000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865511002935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["S0167865511002935"],"URL":"https:\/\/doi.org\/10.1016\/j.patrec.2011.09.020","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}