{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:06:28Z","timestamp":1765544788191,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T00:00:00Z","timestamp":1615161600000},"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":[[2021,3,8]]},"DOI":"10.1145\/3437963.3441749","type":"proceedings-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T04:36:17Z","timestamp":1615005377000},"page":"1047-1055","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Toward User Engagement Optimization in 2D Presentation"],"prefix":"10.1145","author":[{"given":"Liang","family":"Wu","sequence":"first","affiliation":[{"name":"Airbnb, San Francisco, CA, USA"}]},{"given":"Mihajlo","family":"Grbovic","sequence":"additional","affiliation":[{"name":"Airbnb, San Francisco, CA, USA"}]},{"given":"Jundong","family":"Li","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,3,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_2_1","first-page":"23","article-title":"From ranknet to lambdarank to lambdamart: An overview","volume":"11","author":"Burges Christopher JC","year":"2010","unstructured":"Christopher JC Burges . 2010 . From ranknet to lambdarank to lambdamart: An overview . Learning , Vol. 11 , 23 -- 581 (2010), 81. Christopher JC Burges. 2010. From ranknet to lambdarank to lambdamart: An overview. Learning, Vol. 11, 23--581 (2010), 81.","journal-title":"Learning"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010065"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983829"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2893486"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572021"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556562"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/945365.964285"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646943.712093"},{"key":"e_1_3_2_1_12_1","volume-title":"Greedy function approximation: a gradient boosting machine. Annals of statistics","author":"Friedman Jerome H","year":"2001","unstructured":"Jerome H Friedman . 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics ( 2001 ), 1189--1232. Jerome H Friedman. 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics (2001), 1189--1232."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-014-1599-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187914"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130332.3130334"},{"key":"e_1_3_2_1_17_1","volume-title":"On information and sufficiency. The annals of mathematical statistics","author":"Kullback Solomon","year":"1951","unstructured":"Solomon Kullback and Richard A Leibler . 1951. On information and sufficiency. The annals of mathematical statistics , Vol. 22 , 1 ( 1951 ), 79--86. Solomon Kullback and Richard A Leibler. 1951. On information and sufficiency. The annals of mathematical statistics, Vol. 22, 1 (1951), 79--86."},{"volume-title":"Efficient backprop. Neural networks: Tricks of the trade","author":"LeCun Yann A","key":"e_1_3_2_1_18_1","unstructured":"Yann A LeCun , L\u00e9on Bottou , Genevieve B Orr , and Klaus-Robert M\u00fcller . 2012. Efficient backprop. Neural networks: Tricks of the trade . Springer , 9--48. Yann A LeCun, L\u00e9on Bottou, Genevieve B Orr, and Klaus-Robert M\u00fcller. 2012. Efficient backprop. Neural networks: Tricks of the trade. Springer, 9--48."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963453"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767723"},{"key":"e_1_3_2_1_21_1","volume-title":"Mcrank: Learning to rank using multiple classification and gradient boosting. In Advances in neural information processing systems. 897--904.","author":"Li Ping","year":"2008","unstructured":"Ping Li , Qiang Wu , and Christopher J Burges . 2008 . Mcrank: Learning to rank using multiple classification and gradient boosting. In Advances in neural information processing systems. 897--904. Ping Li, Qiang Wu, and Christopher J Burges. 2008. Mcrank: Learning to rank using multiple classification and gradient boosting. In Advances in neural information processing systems. 897--904."},{"key":"e_1_3_2_1_22_1","volume-title":"Matthew Wiener, et al","author":"Liaw Andy","year":"2002","unstructured":"Andy Liaw , Matthew Wiener, et al . 2002 . Classification and regression by randomForest. R news, Vol. 2 , 3 (2002), 18--22. Andy Liaw, Matthew Wiener, et al. 2002. Classification and regression by randomForest. R news, Vol. 2, 3 (2002), 18--22."},{"key":"e_1_3_2_1_23_1","volume-title":"Foundations and Trends\u00ae in Information Retrieval","volume":"3","author":"Liu Tie-Yan","year":"2009","unstructured":"Tie-Yan Liu . 2009 . Learning to rank for information retrieval . Foundations and Trends\u00ae in Information Retrieval , Vol. 3 , 3 (2009), 225--331. Tie-Yan Liu. 2009. Learning to rank for information retrieval. Foundations and Trends\u00ae in Information Retrieval, Vol. 3, 3 (2009), 225--331."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398671"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1207\/153276603768344762"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9123-y"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390404"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124333"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Shubhra Kanti Karmaker Santu Parikshit Sondhi and ChengXiang Zhai. 2017. On Application of Learning to Rank for E-Commerce Search. (2017).  Shubhra Kanti Karmaker Santu Parikshit Sondhi and ChengXiang Zhai. 2017. On Application of Learning to Rank for E-Commerce Search. (2017).","DOI":"10.1145\/3077136.3080838"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487630"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341544"},{"key":"e_1_3_2_1_32_1","unstructured":"Hamed Valizadegan Rong Jin Ruofei Zhang and Jianchang Mao. 2009. Learning to rank by optimizing ndcg measure. In Advances in neural information processing systems. 1883--1891.  Hamed Valizadegan Rong Jin Ruofei Zhang and Jianchang Mao. 2009. Learning to rank by optimizing ndcg measure. In Advances in neural information processing systems. 1883--1891."},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. ACM, 165--174","author":"Gysel Christophe Van","year":"2016","unstructured":"Christophe Van Gysel , Maarten de Rijke , and Evangelos Kanoulas . 2016 . Learning latent vector spaces for product search . Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. ACM, 165--174 . Christophe Van Gysel, Maarten de Rijke, and Evangelos Kanoulas. 2016. Learning latent vector spaces for product search. Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. ACM, 165--174."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505664"},{"key":"e_1_3_2_1_35_1","volume-title":"Cost-sensitive learning for utility optimization in online advertising auctions. arXiv preprint arXiv:1603.03713","author":"Vasile Flavian","year":"2016","unstructured":"Flavian Vasile , Damien Lefortier , and Olivier Chapelle . 2016. Cost-sensitive learning for utility optimization in online advertising auctions. arXiv preprint arXiv:1603.03713 ( 2016 ). Flavian Vasile, Damien Lefortier, and Olivier Chapelle. 2016. Cost-sensitive learning for utility optimization in online advertising auctions. arXiv preprint arXiv:1603.03713 (2016)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911537"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835824"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9112-1"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390355"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2017.58"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939677"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556215"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623633"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592748.1592756"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572042"}],"event":{"name":"WSDM '21: The Fourteenth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event Israel","acronym":"WSDM '21"},"container-title":["Proceedings of the 14th ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441749","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:35Z","timestamp":1750193255000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441749"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,8]]},"references-count":46,"alternative-id":["10.1145\/3437963.3441749","10.1145\/3437963"],"URL":"https:\/\/doi.org\/10.1145\/3437963.3441749","relation":{},"subject":[],"published":{"date-parts":[[2021,3,8]]},"assertion":[{"value":"2021-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}