{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:49:30Z","timestamp":1757540970728,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T00:00:00Z","timestamp":1531958400000},"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":[[2018,7,19]]},"DOI":"10.1145\/3219819.3219857","type":"proceedings-article","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T13:05:12Z","timestamp":1532005512000},"page":"941-950","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["RapidScorer"],"prefix":"10.1145","author":[{"given":"Ting","family":"Ye","sequence":"first","affiliation":[{"name":"Microsoft, Vancouver, BC, Canada"}]},{"given":"Hucheng","family":"Zhou","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"given":"Will Y.","family":"Zou","sequence":"additional","affiliation":[{"name":"Microsoft, Sunnyvale, CA, USA"}]},{"given":"Bin","family":"Gao","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}]},{"given":"Ruofei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft, Sunnyvale, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,7,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2011. Intel\u00ae 64 and IA-32 Architectures Software Developer Manual. (2011).  2011. Intel\u00ae 64 and IA-32 Architectures Software Developer Manual. (2011)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.73"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_2_1_4_1","unstructured":"C. J. C. Burges. 2010. Fr. RankNet to LambdaRank to LambdaMART: An Overview.  C. J. C. Burges. 2010. Fr. RankNet to LambdaRank to LambdaMART: An Overview."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718538"},{"volume-title":"Proceedings of the Yahoo! Learning to Rank Challenge. 1--24","year":"2011","author":"Chapelle Olivier","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_2_1_8_1","unstructured":"T. Chen L. Tang Q. Liu D. Yang S. Xie X. Cao C. Wu E. Yao Z. Liu Z. Jiang etal 2012. Combining factorization model and additive forest for collaborative followee recommendation. KDD CUP (2012).  T. Chen L. Tang Q. Liu D. Yang S. Xie X. Cao C. Wu E. Yao Z. Liu Z. Jiang et al. 2012. Combining factorization model and additive forest for collaborative followee recommendation. KDD CUP (2012)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/518909.791841"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987380"},{"key":"e_1_3_2_1_11_1","unstructured":"Jeffrey Dean. 2014. Large Scale Deep Learning. (2014). https:\/\/research.google.com\/people\/jeff\/CIKM-keynote-Nov2014.pdf  Jeffrey Dean. 2014. Large Scale Deep Learning. (2014). https:\/\/research.google.com\/people\/jeff\/CIKM-keynote-Nov2014.pdf"},{"key":"e_1_3_2_1_12_1","unstructured":"W. Dong J. Li R. Yao C. Li T. Yuan and L. Wang. 2016. Characterizing Driving Styles with Deep Learning. arXiv:1607.03611 (2016).  W. Dong J. Li R. Yao C. Li T. Yuan and L. Wang. 2016. Characterizing Driving Styles with Deep Learning. arXiv:1607.03611 (2016)."},{"key":"e_1_3_2_1_13_1","unstructured":"N. Firasta M. Buxton P. Jinbo K. Nasri and S. Kuo. 2008. Intel AVX: New frontiers in performance improvements and energy efficiency. White paper (2008).  N. Firasta M. Buxton P. Jinbo K. Nasri and S. Kuo. 2008. Intel AVX: New frontiers in performance improvements and energy efficiency. White paper (2008)."},{"volume-title":"Greedy function approximation: a gradient boosting machine. Annals of statistics","year":"2001","author":"Friedman Jerome H.","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2648584.2648589"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03024089"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911520"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.159"},{"volume-title":"Working notes of the AAAI-94 workshop on case-based reasoning.","author":"Langley Pat","key":"e_1_3_2_1_19_1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054192"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098175"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2914763"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767733"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2914758"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687569"},{"volume-title":"Anna Veronika Dorogush, and Andrey Gulin","year":"2017","author":"Prokhorenkova Liudmila","key":"e_1_3_2_1_26_1"},{"volume-title":"CoRR abs\/1306.2597","year":"2013","author":"Qin Tao","key":"e_1_3_2_1_27_1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1967.5493"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2000.12005235"},{"key":"e_1_3_2_1_30_1","unstructured":"Schigehiko Schamoni. 2012. Ranking with Boosted Decision Trees. (2012). http:\/\/www.ccs.neu.edu\/home\/vip\/teach\/MLcourse\/4_boosting\/materials\/Schamoni_boosteddecisiontrees.pdf  Schigehiko Schamoni. 2012. Ranking with Boosted Decision Trees. (2012). http:\/\/www.ccs.neu.edu\/home\/vip\/teach\/MLcourse\/4_boosting\/materials\/Schamoni_boosteddecisiontrees.pdf"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609525"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.809248"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963461"},{"volume-title":"SERF: Efficient Scheduling for Fast Deep Neural Network Serving via Judicious Parallelism. Supercomputing","year":"2016","author":"Yan F.","key":"e_1_3_2_1_34_1"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098059"}],"event":{"name":"KDD '18: The 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"London United Kingdom","acronym":"KDD '18"},"container-title":["Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219819.3219857","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219819.3219857","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:43Z","timestamp":1750208923000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219819.3219857"}},"subtitle":["Fast Tree Ensemble Evaluation by Maximizing Compactness in Data Level Parallelization"],"short-title":[],"issued":{"date-parts":[[2018,7,19]]},"references-count":35,"alternative-id":["10.1145\/3219819.3219857","10.1145\/3219819"],"URL":"https:\/\/doi.org\/10.1145\/3219819.3219857","relation":{},"subject":[],"published":{"date-parts":[[2018,7,19]]},"assertion":[{"value":"2018-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}