{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:24Z","timestamp":1750307004875,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"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":[[2012,8,12]]},"DOI":"10.1145\/2351356.2351365","type":"proceedings-article","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T13:09:52Z","timestamp":1346159392000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Dynamic ad layout revenue optimization for display advertising"],"prefix":"10.1145","author":[{"given":"Haibin","family":"Cheng","sequence":"first","affiliation":[{"name":"Yahoo! Labs, Santa Clara, CA"}]},{"given":"Eren","family":"Manavoglu","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Santa Clara, CA"}]},{"given":"Ying","family":"Cui","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Santa Clara, CA"}]},{"given":"Ruofei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Santa Clara, CA"}]},{"given":"Jianchang","family":"Mao","sequence":"additional","affiliation":[{"name":"Yahoo! Labs, Santa Clara, CA"}]}],"member":"320","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1189","volume":"29","author":"Adler M.","year":"2000","unstructured":"M. Adler , P. B. Gibbons , and Y. Matias . Scheduling space-sharing for internet advertising. Annals of Statistics , 29 : 1189 -- 1232 , 2000 . M. Adler, P. B. Gibbons, and Y. Matias. Scheduling space-sharing for internet advertising. Annals of Statistics, 29:1189--1232, 2000.","journal-title":"Scheduling space-sharing for internet advertising. Annals of Statistics"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935832"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020454"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(01)00065-2"},{"key":"e_1_3_2_1_5_1","first-page":"1189","volume-title":"Annals of Statistics","author":"Friedman J. H.","year":"2000","unstructured":"J. H. Friedman . Greedy function approximation: A gradient boosting machine . Annals of Statistics , pages 1189 -- 1232 , 2000 . J. H. Friedman. Greedy function approximation: A gradient boosting machine. Annals of Statistics, pages 1189--1232, 2000."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/3104322.3104326"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/978-0-387-84858-7_10","volume-title":"boosting and additive trees. Elements of Statistical Learning: Data mining, Inference, and Prediction","author":"Hastie T.","year":"2009","unstructured":"T. Hastie , R. Tibshirani , and J. H. Friedman . boosting and additive trees. Elements of Statistical Learning: Data mining, Inference, and Prediction , pages 337 -- 384 , 2009 . T. Hastie, R. Tibshirani, and J. H. Friedman. boosting and additive trees. Elements of Statistical Learning: Data mining, Inference, and Prediction, pages 337--384, 2009."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/141975.142034"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_3_2_1_10_1","unstructured":"RMX. Right media exchange. http:\/\/rightmedia.com\/.  RMX. Right media exchange. http:\/\/rightmedia.com\/."},{"key":"e_1_3_2_1_11_1","volume-title":"Yahoo! Labs","author":"Vee E.","year":"2009","unstructured":"E. Vee , S. Vassilvitskii , and J. Shanmugasundaram . Optimal online assignment with forecasts. Technical report , Yahoo! Labs , 2009 . E. Vee, S. Vassilvitskii, and J. Shanmugasundaram. Optimal online assignment with forecasts. Technical report, Yahoo! Labs, 2009."},{"key":"e_1_3_2_1_12_1","volume-title":"CoRR: Computing Research Repository","author":"Yang J.","year":"2010","unstructured":"J. Yang , E. Vee , S. Vassilvitskii , J. Tomlin , J. Shanmugasundaram , T. Anastasakos , and O. Kennedy . Inventory allocation for online graphical display advertising . CoRR: Computing Research Repository , 2010 . J. Yang, E. Vee, S. Vassilvitskii, J. Tomlin, J. Shanmugasundaram, T. Anastasakos, and O. Kennedy. Inventory allocation for online graphical display advertising. CoRR: Computing Research Repository, 2010."},{"key":"e_1_3_2_1_13_1","first-page":"856","volume-title":"Proceedings of the 20th International Conference on Machine Learning","author":"Yu L.","year":"2003","unstructured":"L. Yu and H. Liu . Feature selection for high-dimensional data: A fast correlation-based filter solution . In Proceedings of the 20th International Conference on Machine Learning , pages 856 -- 863 , 2003 . L. Yu and H. Liu. Feature selection for high-dimensional data: A fast correlation-based filter solution. In Proceedings of the 20th International Conference on Machine Learning, pages 856--863, 2003."},{"key":"e_1_3_2_1_14_1","first-page":"856","volume-title":"Proceedings of the 2009 2nd International Symposium on Information Science and Engineering","author":"Zhang L. H.","year":"2009","unstructured":"L. H. Zhang and L. Liu . Feature selection for high-dimensional data: A fast correlation-based filter solution . In Proceedings of the 2009 2nd International Symposium on Information Science and Engineering , pages 856 -- 863 , Washington, DC, USA , 2009 . L. H. Zhang and L. Liu. Feature selection for high-dimensional data: A fast correlation-based filter solution. In Proceedings of the 2009 2nd International Symposium on Information Science and Engineering, pages 856--863, Washington, DC, USA, 2009."}],"event":{"name":"KDD '12: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Beijing China","acronym":"KDD '12"},"container-title":["Proceedings of the Sixth International Workshop on Data Mining for Online Advertising and Internet Economy"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2351356.2351365","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2351356.2351365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:54Z","timestamp":1750236534000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2351356.2351365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":14,"alternative-id":["10.1145\/2351356.2351365","10.1145\/2351356"],"URL":"https:\/\/doi.org\/10.1145\/2351356.2351365","relation":{},"subject":[],"published":{"date-parts":[[2012,8,12]]},"assertion":[{"value":"2012-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}