{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:19:44Z","timestamp":1784179184058,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T00:00:00Z","timestamp":1502064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP170102231, DP140102655"],"award-info":[{"award-number":["DP170102231, DP140102655"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,7]]},"DOI":"10.1145\/3077136.3080819","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T19:35:01Z","timestamp":1501270501000},"page":"445-454","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["Efficient Cost-Aware Cascade Ranking in Multi-Stage Retrieval"],"prefix":"10.1145","author":[{"given":"Ruey-Cheng","family":"Chen","sequence":"first","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luke","family":"Gallagher","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roi","family":"Blanco","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. Shane","family":"Culpepper","sequence":"additional","affiliation":[{"name":"RMIT University, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9217-9"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"N. Asadi and J. Lin. 2013. Training efficient tree-based models for document ranking Proc. ECIR. 146--157. N. Asadi and J. Lin. 2013. Training efficient tree-based models for document ranking Proc. ECIR. 146--157.","DOI":"10.1007\/978-3-642-36973-5_13"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.73"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2188385.2188395"},{"key":"e_1_3_2_1_5_1","first-page":"23","article-title":"From ranknet to lambdarank to lambdamart: An overview","volume":"11","author":"Burges C.","year":"2010","journal-title":"Learning"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718538"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2016.05.004"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835683"},{"key":"e_1_3_2_1_9_1","volume-title":"1--24","author":"Chapelle O.","year":"2011"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-016-9279-1"},{"key":"e_1_3_2_1_11_1","volume-title":"Dynamic Cutoff Prediction in Multi-Stage Retrieval Systems Proc. ADCS. 17--24","author":"Culpepper J. S."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559168"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"X. Jin T. Yang and X. Tang. 2016. A Comparison of Cache Blocking Methods for Fast Execution of Ensemble-based Score Computation Proc. SIGIR. 629--638. X. Jin T. Yang and X. Tang. 2016. A Comparison of Cache Blocking Methods for Fast Execution of Ensemble-based Score Computation Proc. SIGIR. 629--638.","DOI":"10.1145\/2911451.2911520"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_1_16_1","volume-title":"On the Cost of Extracting Proximity Features for Term-Dependency Models Proc. CIKM. 293--302","author":"Lu X.","year":"2015"},{"key":"e_1_3_2_1_17_1","volume-title":"Efficient and Effective Higher Order Proximity Modeling Proc. ICTIR. 21--30","author":"Lu X."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"C. Lucchese F. M. Nardini S. Orlando R. Perego F. Silvestri and S. Trani. 2016. Post-learning optimization of tree ensembles for efficient ranking Proc. SIGIR. 949--952. C. Lucchese F. M. Nardini S. Orlando R. Perego F. Silvestri and S. Trani. 2016. Post-learning optimization of tree ensembles for efficient ranking Proc. SIGIR. 949--952.","DOI":"10.1145\/2911451.2914763"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"C. Lucchese F. M. Nardini S. Orlando R. Perego N. Tonellotto and R. Venturini. 2015. QuickScorer: A Fast Algorithm to Rank Documents with Additive Ensembles of Regression Trees Proc. SIGIR. 73--82. C. Lucchese F. M. Nardini S. Orlando R. Perego N. Tonellotto and R. Venturini. 2015. QuickScorer: A Fast Algorithm to Rank Documents with Additive Ensembles of Regression Trees Proc. SIGIR. 73--82.","DOI":"10.1145\/2766462.2767733"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"C. Lucchese F. M. Nardini S. Orlando R. Perego N. Tonellotto and R. Venturini. 2016. Exploiting CPU SIMD extensions to speed-up document scoring with tree ensembles Proc. SIGIR. 833--836. C. Lucchese F. M. Nardini S. Orlando R. Perego N. Tonellotto and R. Venturini. 2016. Exploiting CPU SIMD extensions to speed-up document scoring with tree ensembles Proc. SIGIR. 833--836.","DOI":"10.1145\/2911451.2914758"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"C. Macdonald R. L. T. Santos and I. Ounis. 2012. On the Usefulness of Query Features for Learning to Rank Proc. CIKM. 2559--2562. C. Macdonald R. L. T. Santos and I. Ounis. 2012. On the Usefulness of Query Features for Learning to Rank Proc. CIKM. 2559--2562.","DOI":"10.1145\/2396761.2398691"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9209-9"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2493175.2493176"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076115"},{"key":"e_1_3_2_1_25_1","first-page":"77","article-title":"Web-Search Ranking with Initialized Gradient Boosted Regression Trees","volume":"14","author":"Mohan A.","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_26_1","volume-title":"SIGIR","author":"Pedersen J.","year":"2010"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"M. Petri A. Moffat and J. S. Culpepper. 2014. Score-safe term dependency processing with hybrid indexes Proc. SIGIR. 899--902. M. Petri A. Moffat and J. S. Culpepper. 2014. Score-safe term dependency processing with hybrid indexes Proc. SIGIR. 899--902.","DOI":"10.1145\/2600428.2609469"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"V. C. Raykar B. Krishnapuram and S. Yu. 2010. Designing efficient cascaded classifiers: tradeoff between accuracy and cost Proc. KDD. 853--860. V. C. Raykar B. Krishnapuram and S. Yu. 2010. Designing efficient cascaded classifiers: tradeoff between accuracy and cost Proc. KDD. 853--860.","DOI":"10.1145\/1835804.1835912"},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. TREC-3.","author":"Robertson S. E."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2015.07.002"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression Shrinkage and Selection Via the Lasso","volume":"58","author":"Tibshirani R.","year":"1994","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422256.2422269"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.3115\/1687878.1687946"},{"key":"e_1_3_2_1_34_1","volume-title":"Parallel Boosted Regression Trees for Web Search Ranking Proc. WWW. 387--396","author":"Tyree S."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835475"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"L. Wang J. Lin and D. Metzler. 2011. A Cascade Ranking Model for Efficient Ranked Retrieval Proc. SIGIR. 105--114. L. Wang J. Lin and D. Metzler. 2011. A Cascade Ranking Model for Efficient Ranked Retrieval Proc. SIGIR. 105--114.","DOI":"10.1145\/2009916.2009934"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2577274"},{"key":"e_1_3_2_1_38_1","volume-title":"Proc. ICML. 133--141","author":"Xu Z."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2670319"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/984321.984322"}],"event":{"name":"SIGIR '17: The 40th International ACM SIGIR conference on research and development in Information Retrieval","location":"Shinjuku Tokyo Japan","acronym":"SIGIR '17","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3077136.3080819","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3077136.3080819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:37:18Z","timestamp":1750217838000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3077136.3080819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,7]]},"references-count":40,"alternative-id":["10.1145\/3077136.3080819","10.1145\/3077136"],"URL":"https:\/\/doi.org\/10.1145\/3077136.3080819","relation":{},"subject":[],"published":{"date-parts":[[2017,8,7]]},"assertion":[{"value":"2017-08-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}