{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T22:50:22Z","timestamp":1772751022983,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"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":[[2020,10,19]]},"DOI":"10.1145\/3340531.3417454","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T05:31:05Z","timestamp":1603085465000},"page":"3281-3284","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Empirical Analysis of Impact of Query-Specific Customization of nDCG"],"prefix":"10.1145","author":[{"given":"Shubhra (Santu) K.","family":"Karmaker","sequence":"first","affiliation":[{"name":"Auburn University, Auburn, AL, USA"}]},{"given":"Parikshit","family":"Sondhi","sequence":"additional","affiliation":[{"name":"Snap Inc., Sunnyvale, CA, USA"}]},{"given":"ChengXiang","family":"Zhai","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Random forests. Machine learning","author":"Breiman Leo","year":"2001","unstructured":"Leo Breiman . 2001. Random forests. Machine learning , Vol. 45 , 1 ( 2001 ), 5--32. Leo Breiman. 2001. Random forests. Machine learning, Vol. 45, 1 (2001), 5--32."},{"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: 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 (2010), 23 -- 581 . Christopher JC Burges. 2010. From ranknet to lambdarank to lambdamart: An overview. Learning, Vol. 11 (2010), 23--581.","journal-title":"Learning"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442794"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/945365.964285"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009932"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646032"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080838"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-006-9019-z"},{"key":"e_1_3_2_2_11_1","volume-title":"abs\/1306.2597","author":"Qin Tao","year":"2013","unstructured":"Tao Qin and Tie-Yan Liu . 2013. Introducing LETOR 4.0 Datasets . Co RR , Vol . abs\/1306.2597 ( 2013 ). http:\/\/arxiv.org\/abs\/1306.2597 Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 Datasets. CoRR, Vol. abs\/1306.2597 (2013). http:\/\/arxiv.org\/abs\/1306.2597"},{"key":"e_1_3_2_2_12_1","unstructured":"Tao Qin and Tie-Yan Liu. 2010 (Accessed: 2018-01--20). Microsoft Learning to Rank Datasets. https:\/\/www.microsoft.com\/en-us\/research\/project\/mslr\/  Tao Qin and Tie-Yan Liu. 2010 (Accessed: 2018-01--20). Microsoft Learning to Rank Datasets. https:\/\/www.microsoft.com\/en-us\/research\/project\/mslr\/"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348502"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383963"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Jun Xu and Hang Li. 2007. Adarank: a boosting algorithm for information retrieval. In ACM SIGIR. ACM 391--398.  Jun Xu and Hang Li. 2007. Adarank: a boosting algorithm for information retrieval. In ACM SIGIR. ACM 391--398.","DOI":"10.1145\/1277741.1277809"}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Ireland","acronym":"CIKM '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3417454","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3417454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:42Z","timestamp":1750197762000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3417454"}},"subtitle":["A Case-Study with Learning-to-Rank Methods"],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":15,"alternative-id":["10.1145\/3340531.3417454","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3417454","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}