{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:59Z","timestamp":1750221359015,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,1,3]],"date-time":"2019-01-03T00:00:00Z","timestamp":1546473600000},"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":[[2019,1,3]]},"DOI":"10.1145\/3297001.3297010","type":"proceedings-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T21:45:18Z","timestamp":1547847918000},"page":"70-77","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Enhanced Learning to Rank using Cluster-loss Adjustment"],"prefix":"10.1145","author":[{"given":"Ahsaas","family":"Bajaj","sequence":"first","affiliation":[{"name":"Samsung R&D Institute, Bengaluru, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hemant","family":"Tiwari","sequence":"additional","affiliation":[{"name":"Samsung R&D Institute, Bengaluru, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vanraj","family":"Vala","sequence":"additional","affiliation":[{"name":"Samsung R&D Institute, Bengaluru, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,1,3]]},"reference":[{"volume-title":"Analysis of ordinal categorical data","author":"Agresti Alan","key":"e_1_3_2_1_1_1","unstructured":"Alan Agresti . 2010. Analysis of ordinal categorical data . Vol. 656 . John Wiley & Sons . Alan Agresti. 2010. Analysis of ordinal categorical data. Vol. 656. John Wiley & Sons."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_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 11 , 23 - 581 (2010), 81. Christopher JC Burges. 2010. From ranknet to lambdarank to lambdamart: An overview. Learning 11, 23-581 (2010), 81.","journal-title":"Learning"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","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.","DOI":"10.7551\/mitpress\/7503.003.0029"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_6_1","first-page":"933","article-title":"An efficient boosting algorithm for combining preferences","author":"Freund Yoav","year":"2003","unstructured":"Yoav Freund , Raj Iyer , Robert E Schapire , and Yoram Singer . 2003 . An efficient boosting algorithm for combining preferences . Journal of machine learning research 4 , Nov (2003), 933 -- 969 . Yoav Freund, Raj Iyer, Robert E Schapire, and Yoram Singer. 2003. An efficient boosting algorithm for combining preferences. Journal of machine learning research 4, Nov (2003), 933--969.","journal-title":"Journal of machine learning research 4"},{"key":"e_1_3_2_1_7_1","volume-title":"Large margin rank boundaries for ordinal regression. Advances in large margin classifiers","author":"Herbrich Ralf","year":"2000","unstructured":"Ralf Herbrich . 2000. Large margin rank boundaries for ordinal regression. Advances in large margin classifiers ( 2000 ), 115--132. Ralf Herbrich. 2000. Large margin rank boundaries for ordinal regression. Advances in large margin classifiers (2000), 115--132."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"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.1093\/biomet\/30.1-2.81"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9123-y"},{"key":"e_1_3_2_1_12_1","volume-title":"NIPS Workshop on Advances in Ranking. 58--63","author":"Sculley D","year":"2009","unstructured":"D Sculley . 2009 . Large scale learning to rank . In NIPS Workshop on Advances in Ranking. 58--63 . D Sculley. 2009. Large scale learning to rank. In NIPS Workshop on Advances in Ranking. 58--63."},{"key":"e_1_3_2_1_13_1","unstructured":"Tie-Yan Liu Tao Qin. 2010. Microsoft learning to rank datasets. https:\/\/www.microsoft.com\/en-us\/research\/project\/mslr\/. Tie-Yan Liu Tao Qin. 2010. Microsoft learning to rank datasets. https:\/\/www.microsoft.com\/en-us\/research\/project\/mslr\/."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553509"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_1_16_1","unstructured":"Yahoo 2011. Yahoo! Learning to Rank Challenge. Yahoo. https:\/\/webscope.sandbox.yahoo.com\/catalog.php?datatype=c. Yahoo 2011. Yahoo! Learning to Rank Challenge. Yahoo. https:\/\/webscope.sandbox.yahoo.com\/catalog.php?datatype=c."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015332"}],"event":{"name":"CoDS-COMAD '19: 6th ACM IKDD CoDS and 24th COMAD","acronym":"CoDS-COMAD '19","location":"Kolkata India"},"container-title":["Proceedings of the ACM India Joint International Conference on Data Science and Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297001.3297010","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297001.3297010","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:14Z","timestamp":1750213574000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297001.3297010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,3]]},"references-count":17,"alternative-id":["10.1145\/3297001.3297010","10.1145\/3297001"],"URL":"https:\/\/doi.org\/10.1145\/3297001.3297010","relation":{},"subject":[],"published":{"date-parts":[[2019,1,3]]},"assertion":[{"value":"2019-01-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}