{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:29:53Z","timestamp":1775471393994,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,28]],"date-time":"2009-06-28T00:00:00Z","timestamp":1246147200000},"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":[[2009,6,28]]},"DOI":"10.1145\/1592748.1592756","type":"proceedings-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T13:29:27Z","timestamp":1249997367000},"page":"55-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Revenue optimization with relevance constraint in sponsored search"],"prefix":"10.1145","author":[{"given":"Yunzhang","family":"Zhu","sequence":"first","affiliation":[{"name":"Microsoft Resarch Asia, Beijing, China and Tsinghua University, Beijing, China"}]},{"given":"Gang","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Resarch Asia, Beijing, China"}]},{"given":"Junli","family":"Yang","sequence":"additional","affiliation":[{"name":"Microsoft Resarch Asia, Beijing, China and Nankai University, Tianjing, China"}]},{"given":"Dakan","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Resarch Asia, Beijing, China and Shanghai Jiaotong University, Shanghai, China"}]},{"given":"Jun","family":"Yan","sequence":"additional","affiliation":[{"name":"Microsoft Resarch Asia, Beijing, China"}]},{"given":"Zheng","family":"Chen","sequence":"additional","affiliation":[{"name":"Microsoft Resarch Asia, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2009,6,28]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R.","year":"1999","unstructured":"R. Baeza-Yates and B. Ribeiro-Neto . Modern Information Retrieval . Addison Wesley , 1999 . R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, 1999."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458217"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367554"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367529"},{"key":"e_1_3_2_1_5_1","volume-title":"Workshop on Targeting and Ranking in Online Advertising 2008","author":"Dembczynski K.","year":"2008","unstructured":"K. Dembczynski , W. Kotlowski , and D. Weiss . Predicting ads' click-through rate with decision rules . In Workshop on Targeting and Ranking in Online Advertising 2008 , 2008 . K. Dembczynski, W. Kotlowski, and D. Weiss. Predicting ads' click-through rate with decision rules. In Workshop on Targeting and Ranking in Online Advertising 2008, 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572042"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1050.0135"},{"key":"e_1_3_2_1_8_1","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 . In Advances in Large Margin Classifiers , 2000 . R. Herbrich, T. Graepel, and K. Obermayer. Large margin rank boundaries for ordinal regression. In Advances in Large Margin Classifiers, 2000."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148265"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390404"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 2nd Workshop on Sponsored Search Auctions","author":"Regelson M.","year":"2006","unstructured":"M. Regelson and D. C. Fain . Predicting click-through rate using keyword clusters . In Proceedings of the 2nd Workshop on Sponsored Search Auctions , 2006 . M. Regelson and D. C. Fain. Predicting click-through rate using keyword clusters. In Proceedings of the 2nd Workshop on Sponsored Search Auctions, 2006."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1108\/EUM0000000007186"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.384019"}],"event":{"name":"KDD09: The 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Paris France","acronym":"KDD09","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the Third International Workshop on Data Mining and Audience Intelligence for Advertising"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1592748.1592756","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1592748.1592756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:36Z","timestamp":1750253376000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1592748.1592756"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,28]]},"references-count":15,"alternative-id":["10.1145\/1592748.1592756","10.1145\/1592748"],"URL":"https:\/\/doi.org\/10.1145\/1592748.1592756","relation":{},"subject":[],"published":{"date-parts":[[2009,6,28]]},"assertion":[{"value":"2009-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}