{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:05:18Z","timestamp":1775282718373,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T00:00:00Z","timestamp":1301270400000},"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":[],"published-print":{"date-parts":[[2011,3,28]]},"DOI":"10.1145\/1963405.1963460","type":"proceedings-article","created":{"date-parts":[[2011,3,29]],"date-time":"2011-03-29T12:02:18Z","timestamp":1301400138000},"page":"377-386","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["A stochastic learning-to-rank algorithm and its application to contextual advertising"],"prefix":"10.1145","author":[{"given":"Maryam","family":"Karimzadehgan","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruofei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianchang","family":"Mao","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,28]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277810"},{"key":"e_1_3_2_1_2_1","volume-title":"Modern information retrieval","author":"Baeza-Yates R.","unstructured":"R. Baeza-Yates and B. Ribeiro-Neto . Modern information retrieval . Addison Wesley . R. Baeza-Yates and B. Ribeiro-Neto. Modern information retrieval. Addison Wesley."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835476"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(98)00017-6"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277837"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_7_1","first-page":"193","volume-title":"NIPS","author":"Burges C. J.","year":"2006","unstructured":"C. J. Burges , R. Ragno , and Q. V. Le . Learning to rank with nonsmooth cost functions . NIPS , pages 193 -- 200 , 2006 . C. J. Burges, R. Ragno, and Q. V. Le. Learning to rank with nonsmooth cost functions. NIPS, pages 193--200, 2006."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148205"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367554"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9110-3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_44"},{"key":"e_1_3_2_1_13_1","first-page":"137","volume-title":"Symposium on Operating System Design and Implementation","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . Mapreduce: simplified data processing on large clusters . Symposium on Operating System Design and Implementation , pages 137 -- 150 , 2004 . J. Dean and S. Ghemawat. Mapreduce: simplified data processing on large clusters. Symposium on Operating System Design and Implementation, pages 137--150, 2004."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/166648.166653"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277808"},{"key":"e_1_3_2_1_16_1","unstructured":"A. Foundation. Apache hadoop project. http:\/\/hadoop.apache.org\/. A. Foundation. Apache hadoop project. http:\/\/hadoop.apache.org\/."},{"key":"e_1_3_2_1_17_1","first-page":"170","volume-title":"ICML","author":"Freund Y.","year":"1998","unstructured":"Y. Freund , R. Iyer , R. E. Schapire , and Y. Singer . An efficient boosting algorithm for combining preferences . ICML , pages 170 -- 178 , 1998 . Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. ICML, pages 170--178, 1998."},{"key":"e_1_3_2_1_18_1","first-page":"97","volume-title":"Artificial Neural Networks","author":"Herbrich R.","year":"1999","unstructured":"R. Herbrich , T. Graepel , and K. Obermayer . Support vector learning for ordinal regression . Artificial Neural Networks , pages 97 -- 102 , 1999 . R. Herbrich, T. Graepel, and K. Obermayer. Support vector learning for ordinal regression. Artificial Neural Networks, pages 97--102, 1999."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.7551\/mitpress\/1113.003.0010","volume-title":"Advances in Large Margin Classifiers","author":"Herbrich R.","year":"2000","unstructured":"R. Herbrich , T. Graepel , and K. Obermayer . Large margin rank boundaries for ordinal regression . Advances in Large Margin Classifiers , pages 115 -- 132 , 2000 . R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression. Advances in Large Margin Classifiers, pages 115--132, 2000."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540230"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_23_1","first-page":"671","volume-title":"Science","author":"Kirkpatrick S.","year":"1983","unstructured":"S. Kirkpatrick , C. D. Gelatt , and M. P. Vecchi . Optimization by simulated annealing . Science , pages 671 -- 680 , 1983 . S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, pages 671--680, 1983."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148265"},{"key":"e_1_3_2_1_25_1","volume-title":"NIPS","author":"Li P.","year":"2007","unstructured":"P. Li , C. J. Burges , and Q. Wu . Mcrank: Learning to rank using multiple classification and gradient boosting . NIPS , 2007 . P. Li, C. J. Burges, and Q. Wu. Mcrank: Learning to rank using multiple classification and gradient boosting. NIPS, 2007."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_1_27_1","volume-title":"SIGIR-LTR","author":"Liu T.-Y.","year":"2007","unstructured":"T.-Y. Liu , J. Xu , T. Qin , W. Xiong , and H. Li . Letor: Benchmark dataset for research on learning to rank for information retrieval . SIGIR-LTR , 2007 . T.-Y. Liu, J. Xu, T. Qin, W. Xiong, and H. Li. Letor: Benchmark dataset for research on learning to rank for information retrieval. SIGIR-LTR, 2007."},{"key":"e_1_3_2_1_28_1","first-page":"405","volume-title":"Bioinformatics","author":"Lukashin A. V.","year":"2000","unstructured":"A. V. Lukashin and R. Fuchs . Analysis of temporal gene expression profiles: Clustering by simulated annealing and determining the optimal number of clusters . Bioinformatics , pages 405 -- 414 , 2000 . A. V. Lukashin and R. Fuchs. Analysis of temporal gene expression profiles: Clustering by simulated annealing and determining the optimal number of clusters. Bioinformatics, pages 405--414, 2000."},{"key":"e_1_3_2_1_29_1","author":"Metropolis N.","year":"1953","unstructured":"N. Metropolis , A. W. Rosenbluth , M. N. Rosenbluth , A. H. Teller , and E. Teller . Equation of state calculation by fast computing machines. J. Of Chem. Phys., pages 1087--1091 , 1953 . N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculation by fast computing machines. J. Of Chem. Phys., pages 1087--1091, 1953.","journal-title":"Equation of state calculation by fast computing machines. J. Of Chem. Phys., pages 1087--1091"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348599.1348603"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009006"},{"key":"e_1_3_2_1_32_1","author":"Nelder J. A.","year":"1965","unstructured":"J. A. Nelder and R. Mead . A simplex method for function minimization. Computer Journal, pages (7):308--313 , 1965 . J. A. Nelder and R. Mead. A simplex method for function minimization. Computer Journal, pages (7):308--313, 1965.","journal-title":"A simplex method for function minimization. Computer Journal, pages (7):308--313"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060828"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12275-0_13"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291008"},{"key":"e_1_3_2_1_37_1","volume-title":"WWW Workshop","author":"Ratnaparkhi A.","year":"2008","unstructured":"A. Ratnaparkhi . A hidden class page-ad probability model for contextual advertising . WWW Workshop , 2008 . A. Ratnaparkhi. A hidden class page-ad probability model for contextual advertising. WWW Workshop, 2008."},{"key":"e_1_3_2_1_38_1","volume-title":"ACM EC","author":"Regelson M.","year":"2006","unstructured":"M. Regelson and D. Fian . Predicting click-through rate using keyword clusters . ACM EC , 2006 . M. Regelson and D. Fian. Predicting click-through rate using keyword clusters. ACM EC, 2006."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076119"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630270302"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/188490.188561"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341544"},{"key":"e_1_3_2_1_45_1","volume-title":"NIPS","author":"Valizadegan H.","year":"2009","unstructured":"H. Valizadegan , R. Jin , R. Zhang , and J. Mao . Learning to rank by optimizing ndcg measure . NIPS , 2009 . H. Valizadegan, R. Jin, R. Zhang, and J. Mao. Learning to rank by optimizing ndcg measure. NIPS, 2009."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553513"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_3_2_1_48_1","volume-title":"IEEE International Conference on The Chilean Computer Science Society","author":"Yang W.","year":"2005","unstructured":"W. Yang , L. Rueda , and A. Ngom . A simulated annealing approach to find the optimal parameters for fuzzy clustering microarray data . IEEE International Conference on The Chilean Computer Science Society , 2005 . W. Yang, L. Rueda, and A. Ngom. A simulated annealing approach to find the optimal parameters for fuzzy clustering microarray data. IEEE International Conference on The Chilean Computer Science Society, 2005."},{"key":"e_1_3_2_1_49_1","volume-title":"SIGIR-LTR Workshop","author":"Yeh J.-Y.","year":"2007","unstructured":"J.-Y. Yeh , J.-Y. Lin , H.-R. Ke , and W.-P. Yang . Learning to rank for information retrieval using genetic programming . SIGIR-LTR Workshop , 2007 . J.-Y. Yeh, J.-Y. Lin, H.-R. Ke, and W.-P. Yang. Learning to rank for information retrieval using genetic programming. SIGIR-LTR Workshop, 2007."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277790"}],"event":{"name":"WWW '11: 20th International World Wide Web Conference","location":"Hyderabad India","acronym":"WWW '11","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","The International Institute of Information Technology Bangalore The International Institute of Information Technology Bangalore"]},"container-title":["Proceedings of the 20th international conference on World wide web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1963405.1963460","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1963405.1963460","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:18Z","timestamp":1750243938000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1963405.1963460"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,28]]},"references-count":49,"alternative-id":["10.1145\/1963405.1963460","10.1145\/1963405"],"URL":"https:\/\/doi.org\/10.1145\/1963405.1963460","relation":{},"subject":[],"published":{"date-parts":[[2011,3,28]]},"assertion":[{"value":"2011-03-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}