{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T15:46:55Z","timestamp":1783007215647,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,24]],"date-time":"2022-10-24T00:00:00Z","timestamp":1666569600000},"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":[[2022,11,7]]},"DOI":"10.1145\/3528535.3531519","type":"proceedings-article","created":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T21:10:50Z","timestamp":1654031450000},"page":"94-106","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Bolt"],"prefix":"10.1145","author":[{"given":"Eduardo","family":"Romero","sequence":"first","affiliation":[{"name":"The Ohio State University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher","family":"Stewart","sequence":"additional","affiliation":[{"name":"The Ohio State University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angela","family":"Li","sequence":"additional","affiliation":[{"name":"The Ohio State University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kyle","family":"Hale","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nathaniel","family":"Morris","sequence":"additional","affiliation":[{"name":"AMD Research"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,10,24]]},"reference":[{"key":"e_1_3_2_1_1_2","volume-title":"https:\/\/en.wikipedia.org\/wiki\/Decision_tree","year":"2021","unstructured":"Decision tree wikipedia. https:\/\/en.wikipedia.org\/wiki\/Decision_tree, 2021."},{"key":"e_1_3_2_1_2_2","first-page":"932","volume-title":"2018 51st Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO)","author":"Angstadt K.","unstructured":"K. Angstadt, A. Subramaniyan, E. Sadredini, R. Rahimi, K. Skadron, W. Weimer, and R. Das. Aspen: A scalable in-sram architecture for pushdown automata. In 2018 51st Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO), pages 921\u2013932. IEEE, 2018."},{"key":"e_1_3_2_1_3_2","volume-title":"Analyzing the tree-layer structure of deep forests. arXiv e-prints","author":"Arnould L.","year":"2010","unstructured":"L. Arnould, C. Boyer, and E. Scornet. Analyzing the tree-layer structure of deep forests. arXiv e-prints, pages arXiv\u20132010, 2020."},{"key":"e_1_3_2_1_4_2","first-page":"221","volume-title":"2019 IEEE International Conference on Cloud Engineering (IC2E)","author":"Barve Y. D.","unstructured":"Y. D. Barve, S. Shekhar, A. Chhokra, S. Khare, A. Bhattacharjee, Z. Kang, H. Sun, and A. Gokhale. Fecbench: A holistic interference-aware approach for application performance modeling. In 2019 IEEE International Conference on Cloud Engineering (IC2E), pages 211\u2013221. IEEE, 2019."},{"key":"e_1_3_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3351095.3375624"},{"key":"e_1_3_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3318216.3363306"},{"key":"e_1_3_2_1_8_2","first-page":"54","volume-title":"Proceedings of the 2019 SIAM International Conference on Data Mining","author":"Browne J.","unstructured":"J. Browne, D. Mhembere, T. M. Tomita, J. T. Vogelstein, and R. Burns. Forest packing: Fast parallel, decision forests. In Proceedings of the 2019 SIAM International Conference on Data Mining, pages 46\u201354. SIAM, 2019."},{"key":"e_1_3_2_1_9_2","first-page":"4","volume-title":"Xgboost: extreme gradient boosting. R package version 0.4-2","author":"Chen T.","year":"2015","unstructured":"T. Chen, T. He, M. Benesty, V. Khotilovich, and Y. Tang. Xgboost: extreme gradient boosting. R package version 0.4-2, pages 1\u20134, 2015."},{"key":"e_1_3_2_1_10_2","volume-title":"Drawing graphs with dot","author":"Gansner E.","year":"2006","unstructured":"E. Gansner, E. Koutsofios, and S. North. Drawing graphs with dot, 2006."},{"key":"e_1_3_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3361525.3361543"},{"key":"e_1_3_2_1_12_2","volume-title":"How many variables can humans process? Psychological science, 16(1):70\u201376","author":"Halford G. S.","year":"2005","unstructured":"G. S. Halford, R. Baker, J. E. McCredden, and J. D. Bain. How many variables can humans process? Psychological science, 16(1):70\u201376, 2005."},{"key":"e_1_3_2_1_13_2","first-page":"606","volume-title":"International conference on machine learning","author":"Hong S.","year":"2015","unstructured":"S. Hong, T. You, S. Kwak, and B. Han. Online tracking by learning discriminative saliency map with convolutional neural network. In International conference on machine learning, pages 597\u2013606, 2015."},{"key":"e_1_3_2_1_14_2","volume-title":"Enabling deep learning for all-in edge paradigm. arXiv preprint arXiv:2204.03326","author":"Joshi P.","year":"2022","unstructured":"P. Joshi, H. Afli, M. Hasanuzzaman, C. Thapa, and T. Scully. Enabling deep learning for all-in edge paradigm. arXiv preprint arXiv:2204.03326, 2022."},{"key":"e_1_3_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783310"},{"key":"e_1_3_2_1_16_2","volume-title":"From local explanations to global understanding with explainable ai for trees. Nature machine intelligence, 2(1):2522\u20135839","author":"Lundberg S. M.","year":"2020","unstructured":"S. M. Lundberg, G. Erion, H. Chen, A. DeGrave, J. M. Prutkin, B. Nair, R. Katz, J. Himmelfarb, N. Bansal, and S.-I. Lee. From local explanations to global understanding with explainable ai for trees. Nature machine intelligence, 2(1):2522\u20135839, 2020."},{"key":"e_1_3_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/2663165.2663330"},{"key":"e_1_3_2_1_18_2","volume-title":"Lionforests: Local interpretation of random forests through path selection. arXiv preprint arXiv:1911.08780","author":"Mollas I.","year":"2019","unstructured":"I. Mollas, G. Tsoumakas, and N. Bassiliades. Lionforests: Local interpretation of random forests through path selection. arXiv preprint arXiv:1911.08780, 2019."},{"key":"e_1_3_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330755"},{"key":"e_1_3_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190543"},{"key":"e_1_3_2_1_21_2","first-page":"4","author":"Romero E.","year":"2022","unstructured":"E. Romero. Bolt, 4 2022. Repo: https:\/\/github.com\/EduardoRomero83\/CADM.","journal-title":"Bolt"},{"key":"e_1_3_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3458744.3474052"},{"key":"e_1_3_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2021.3078346"},{"key":"e_1_3_2_1_24_2","first-page":"218","volume-title":"International Conference on High Performance Computing","author":"Tracy T.","unstructured":"T. Tracy, Y. Fu, I. Roy, E. Jonas, and P. Glendenning. Towards machine learning on the automata processor. In International Conference on High Performance Computing, pages 200\u2013218. Springer, 2016."},{"key":"e_1_3_2_1_25_2","first-page":"24","volume-title":"2018 IEEE International Symposium on Workload Characterization (IISWC)","author":"Wadden J.","unstructured":"J. Wadden, T. Tracy, E. Sadredini, L. Wu, C. Bo, J. Du, Y. Wei, J. Udall, M. Wallace, M. Stan, et al. Automatazoo: A modern automata processing benchmark suite. In 2018 IEEE International Symposium on Workload Characterization (IISWC), pages 13\u201324. IEEE, 2018."},{"key":"e_1_3_2_1_26_2","volume-title":"ranger: A fast implementation of random forests for high dimensional data in c++ and r. arXiv preprint arXiv:1508.04409","author":"Wright M. N.","year":"2015","unstructured":"M. N. Wright and A. Ziegler. ranger: A fast implementation of random forests for high dimensional data in c++ and r. arXiv preprint arXiv:1508.04409, 2015."},{"key":"e_1_3_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447786.3456251"},{"key":"e_1_3_2_1_28_2","volume-title":"Yelp dataset version 6","year":"2014","unstructured":"Yelp. Yelp dataset version 6, 2014. data retrieved from Kaggle, https:\/\/www.kaggle.com\/yelp-dataset\/yelp-dataset\/version\/6."},{"key":"e_1_3_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.3390\/s20226585"},{"key":"e_1_3_2_1_30_2","volume-title":"Deep forest. arXiv preprint arXiv:1702.08835","author":"Zhou Z.-H.","year":"2017","unstructured":"Z.-H. Zhou and J. Feng. Deep forest. arXiv preprint arXiv:1702.08835, 2017."}],"event":{"name":"Middleware '22: 23rd International Middleware Conference","location":"Quebec QC Canada","acronym":"Middleware '22","sponsor":["ACM Association for Computing Machinery","IFIP"]},"container-title":["Proceedings of the 23rd ACM\/IFIP International Middleware Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528535.3531519","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3528535.3531519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:43Z","timestamp":1750186963000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528535.3531519"}},"subtitle":["Fast Inference for Random Forests"],"short-title":[],"issued":{"date-parts":[[2022,10,24]]},"references-count":30,"alternative-id":["10.1145\/3528535.3531519","10.1145\/3528535"],"URL":"https:\/\/doi.org\/10.1145\/3528535.3531519","relation":{},"subject":[],"published":{"date-parts":[[2022,10,24]]},"assertion":[{"value":"2022-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}