{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T19:06:13Z","timestamp":1768590373152,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T00:00:00Z","timestamp":1530057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["IIS-1528041"],"award-info":[{"award-number":["IIS-1528041"]}],"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":[[2018,6,27]]},"DOI":"10.1145\/3209978.3210022","type":"proceedings-article","created":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T12:12:40Z","timestamp":1530533560000},"page":"315-324","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Privacy-aware Ranking with Tree Ensembles on the Cloud"],"prefix":"10.1145","author":[{"given":"Shiyu","family":"Ji","sequence":"first","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA, USA"}]},{"given":"Jinjin","family":"Shao","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA, USA"}]},{"given":"Daniel","family":"Agun","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA, USA"}]},{"given":"Tao","family":"Yang","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara, Santa Barbara, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007632"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186084"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1796408"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367717"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033036.2033080"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23241"},{"key":"e_1_3_2_1_7_1","volume-title":"TREC","author":"Boytsov L.","year":"2011"},{"key":"e_1_3_2_1_8_1","volume-title":"From ranknet to lambdarank to lambdamart: An overview. Learning, 11(23--581):81","author":"Burges C. J.","year":"2010"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.45"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813700"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2014.23264"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_20"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_30"},{"key":"e_1_3_2_1_15_1","first-page":"1","volume-title":"Yahoo! Learning to Rank Challenge Overview. J. of Machine Learning Research","author":"Chapelle O.","year":"2011"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_33"},{"key":"e_1_3_2_1_17_1","volume-title":"Elements of information theory","author":"Cover T. M.","year":"2012"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2590701.2590705"},{"key":"e_1_3_2_1_19_1","unstructured":"V. Dang. Ranklib-a library of ranking algorithms.  V. Dang. Ranklib-a library of ranking algorithms."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080832"},{"key":"e_1_3_2_1_21_1","volume-title":"UMD and USC\/ISI: TREC 2010 web track experiments with ivory. In Proceedings of The Nineteenth Text REtrieval Conference, TREC 2010","author":"Elsayed T.","year":"2010"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983769"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_25"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2866571"},{"key":"e_1_3_2_1_27_1","volume-title":"NDSS 2012","author":"Islam M. S.","year":"2012"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2009.93"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2004.10.007"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4573(00)00015-7"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_4"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39884-1_22"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382298"},{"issue":"3","key":"e_1_3_2_1_34_1","first-page":"18","article-title":"Classification and regression by randomforest","volume":"2","author":"Liaw A.","year":"2002","journal-title":"R news"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_1_36_1","volume-title":"Applied Soft Computing","author":"Liu X.","year":"2017"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063584"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/1394399"},{"key":"e_1_3_2_1_39_1","first-page":"77","volume-title":"Yahoo! Learning to Rank Challenge","author":"Mohan A.","year":"2011"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-013-7123-9"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756123.1756146"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.38"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043566"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978401"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022643204877"},{"key":"e_1_3_2_1_46_1","volume-title":"5: programs for machine learning","author":"Quinlan J. R.","year":"2014"},{"key":"e_1_3_2_1_47_1","volume-title":"How to exchange secrets with oblivious transfer. IACR Cryptology ePrint Archive","author":"Rabin M. O.","year":"2005"},{"key":"e_1_3_2_1_48_1","first-page":"73","volume-title":"Proceedings of the fourth text retrieval conference","volume":"500","author":"Robertson S. E.","year":"1996"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/331403.331405"},{"key":"e_1_3_2_1_50_1","volume-title":"SP '00","author":"Song D. X.","year":"2000"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.282"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277794"},{"key":"e_1_3_2_1_53_1","unstructured":"the Ponemon Institute. The 2018 global cloud data security study. https:\/\/www2.gemalto.com\/cloud-security-research. Accessed: 2018-05-01.  the Ponemon Institute. The 2018 global cloud data security study. https:\/\/www2.gemalto.com\/cloud-security-research. Accessed: 2018-05-01."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.282"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0043"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2401003"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080831"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2448099"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609527"}],"event":{"name":"SIGIR '18: The 41st International ACM SIGIR conference on research and development in Information Retrieval","location":"Ann Arbor MI USA","acronym":"SIGIR '18","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209978.3210022","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209978.3210022","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209978.3210022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:49Z","timestamp":1750212469000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209978.3210022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,27]]},"references-count":61,"alternative-id":["10.1145\/3209978.3210022","10.1145\/3209978"],"URL":"https:\/\/doi.org\/10.1145\/3209978.3210022","relation":{},"subject":[],"published":{"date-parts":[[2018,6,27]]},"assertion":[{"value":"2018-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}