{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:52Z","timestamp":1750221052860,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T00:00:00Z","timestamp":1539734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"CMU Portugal research project GoLocal","award":["CMUP-ERI\/TIC\/0033\/2014"],"award-info":[{"award-number":["CMUP-ERI\/TIC\/0033\/2014"]}]},{"name":"NOVA LINCS","award":["Ref. UID\/CEC\/04516\/2013"],"award-info":[{"award-number":["Ref. UID\/CEC\/04516\/2013"]}]},{"name":"European Commission H2020 ICT","award":["687605"],"award-info":[{"award-number":["687605"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,17]]},"DOI":"10.1145\/3269206.3269316","type":"proceedings-article","created":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T12:08:27Z","timestamp":1540210107000},"page":"1691-1694","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Low-Complexity Supervised Rank Fusion Models"],"prefix":"10.1145","author":[{"given":"Andr\u00e9","family":"Mour\u00e3o","sequence":"first","affiliation":[{"name":"Universidade NOVA Lisboa, Caparica, Portugal"}]},{"given":"Jo\u00e3o","family":"Magalh\u00e3es","sequence":"additional","affiliation":[{"name":"Universidade NOVA Lisboa, Caparica, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"9","article-title":"Runtime Optimizations for Tree-Based Machine Learning Models","volume":"26","author":"Asadi N.","year":"2014","unstructured":"N. Asadi , J. Lin , and A. P. de Vries . 2014 . Runtime Optimizations for Tree-Based Machine Learning Models . IEEE Trans. on KDE , Vol. 26 , 9 (Sept 2014). N. Asadi, J. Lin, and A. P. de Vries. 2014. Runtime Optimizations for Tree-Based Machine Learning Models. IEEE Trans. on KDE , Vol. 26, 9 (Sept 2014).","journal-title":"IEEE Trans. on KDE"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572114"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742755"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183671"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9123-y"},{"volume-title":"Proc. of TREC .","author":"Roberts Kirk","key":"e_1_3_2_1_6_1","unstructured":"Kirk Roberts , Matthew S. Simpson , Ellen M. Voorhees , and William R. Hersh . 2015. Overview of the TREC 2015 Clinical Decision Support Track . In Proc. of TREC . Kirk Roberts, Matthew S. Simpson, Ellen M. Voorhees, and William R. Hersh. 2015. Overview of the TREC 2015 Clinical Decision Support Track. In Proc. of TREC ."},{"volume-title":"Combination of Multiple Searches. In Text REtrieval Conference (TREC-2) .","author":"Joseph","key":"e_1_3_2_1_7_1","unstructured":"Joseph A. Shaw and Edward A. Fox. 1994 . Combination of Multiple Searches. In Text REtrieval Conference (TREC-2) . Joseph A. Shaw and Edward A. Fox. 1994. Combination of Multiple Searches. In Text REtrieval Conference (TREC-2) ."},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. of TREC .","author":"Simpson Matthew S","year":"2014","unstructured":"Matthew S Simpson , Ellen M Voorhees , and William Hersh . 2014 . Overview of the TREC 2014 Clinical Decision Support Track . In Proc. of TREC . Matthew S Simpson, Ellen M Voorhees, and William Hersh. 2014. Overview of the TREC 2014 Clinical Decision Support Track. In Proc. of TREC ."},{"key":"e_1_3_2_1_9_1","unstructured":"Hamed Valizadegan Rong Jin Ruofei Zhang and Jianchang Mao. 2009. Learning to Rank by Optimizing NDCG Measure. In Advances in NIPS .   Hamed Valizadegan Rong Jin Ruofei Zhang and Jianchang Mao. 2009. Learning to Rank by Optimizing NDCG Measure. In Advances in NIPS ."},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of TREC .","author":"Zhang Min","year":"2002","unstructured":"Min Zhang , Ruihua Song , Chuan Lin , Shaoping Ma , Zhe Jiang , Yijiang Jin , Yiqun Liu , and Le Zhao . 2002 . Expansion-based technologies in finding relevant and new information: THU TREC2002 novelty track experiments . In Proc. of TREC . Min Zhang, Ruihua Song, Chuan Lin, Shaoping Ma, Zhe Jiang, Yijiang Jin, Yiqun Liu, and Le Zhao. 2002. Expansion-based technologies in finding relevant and new information: THU TREC2002 novelty track experiments. In Proc. of TREC ."}],"event":{"name":"CIKM '18: The 27th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Torino Italy","acronym":"CIKM '18"},"container-title":["Proceedings of the 27th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3269316","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3269206.3269316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:44:21Z","timestamp":1750207461000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3269316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,17]]},"references-count":10,"alternative-id":["10.1145\/3269206.3269316","10.1145\/3269206"],"URL":"https:\/\/doi.org\/10.1145\/3269206.3269316","relation":{},"subject":[],"published":{"date-parts":[[2018,10,17]]},"assertion":[{"value":"2018-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}