{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:57:35Z","timestamp":1740099455420,"version":"3.37.3"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T00:00:00Z","timestamp":1595030400000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1618695"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,18]]},"DOI":"10.1145\/3331184.3331256","type":"proceedings-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T17:40:26Z","timestamp":1563558026000},"page":"615-624","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Jointly Modeling Relevance and Sensitivity for Search Among Sensitive Content"],"prefix":"10.1145","author":[{"given":"Mahmoud F.","family":"Sayed","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, College Park, MD, USA"}]},{"given":"Douglas W.","family":"Oard","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, College Park, MD, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,7,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772705"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_2_3_1","first-page":"23","article-title":"From RankNet to LambdaRank to LambdaMART","volume":"11","author":"Burges Christopher J. C.","year":"2010","unstructured":"Christopher J. C. Burges . 2010 . From RankNet to LambdaRank to LambdaMART : An Overview. Learning , Vol. 11 , 23 -- 581 (2010), 81. Christopher J. C. Burges. 2010. From RankNet to LambdaRank to LambdaMART: An Overview. Learning, Vol. 11, 23--581 (2010), 81.","journal-title":"An Overview. Learning"},{"key":"e_1_3_2_2_4_1","volume-title":"Le","author":"Burges Christopher J.","year":"2007","unstructured":"Christopher J. Burges , Robert Ragno , and Quoc V . Le . 2007 . Learning to Rank with Nonsmooth Cost Functions. In Advances in neural information processing systems. 193--200. Christopher J. Burges, Robert Ragno, and Quoc V. Le. 2007. Learning to Rank with Nonsmooth Cost Functions. In Advances in neural information processing systems. 193--200."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148205"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_44"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009933"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718490"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772725"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/945365.964285"},{"key":"e_1_3_2_2_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_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102399"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3121050.3121072"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148246"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-006-9019-z"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9123-y"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963459"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3121050.3121069"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341544"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9112-1"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_86"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277790"},{"key":"e_1_3_2_2_31_1","unstructured":"Zhaohui Zheng Hongyuan Zha Tong Zhang Olivier Chapelle Keke Chen and Gordon Sun. 2008. A General Boosting Method and its Application to Learning Ranking Functions for Web Search. In Advances in neural information processing systems. 1697--1704. Zhaohui Zheng Hongyuan Zha Tong Zhang Olivier Chapelle Keke Chen and Gordon Sun. 2008. A General Boosting Method and its Application to Learning Ranking Functions for Web Search. In Advances in neural information processing systems. 1697--1704."}],"event":{"name":"SIGIR '19: The 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Paris France","acronym":"SIGIR '19"},"container-title":["Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3331184.3331256","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3331184.3331256","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T21:02:43Z","timestamp":1673125363000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3331184.3331256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,18]]},"references-count":30,"alternative-id":["10.1145\/3331184.3331256","10.1145\/3331184"],"URL":"https:\/\/doi.org\/10.1145\/3331184.3331256","relation":{},"subject":[],"published":{"date-parts":[[2019,7,18]]},"assertion":[{"value":"2019-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}