{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:19:32Z","timestamp":1765354772928,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T00:00:00Z","timestamp":1616371200000},"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":[[2021,3,22]]},"DOI":"10.1145\/3412841.3441932","type":"proceedings-article","created":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T05:10:24Z","timestamp":1619154624000},"page":"521-528","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["RaFIO"],"prefix":"10.1145","author":[{"given":"Cam\u00e9lia","family":"Slimani","sequence":"first","affiliation":[{"name":"Univ. Brest, Brest, France"}]},{"given":"Chun-Feng","family":"Wu","sequence":"additional","affiliation":[{"name":"Institute of Information Science Academia Sinica, Taipei, Taiwan"}]},{"given":"Yuan-Hao","family":"Chang","sequence":"additional","affiliation":[{"name":"Institute of Information Science Academia Sinica, Taipei, Taiwan"}]},{"given":"St\u00e9phane","family":"Rubini","sequence":"additional","affiliation":[{"name":"Univ. Brest, Brest, France"}]},{"given":"Jalil","family":"Boukhobza","sequence":"additional","affiliation":[{"name":"ENSTA Bretagne, Brest, France"}]}],"member":"320","published-online":{"date-parts":[[2021,4,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"A. Anghel N. Ioannou T. P. Parnell N. Papandreou C. Mendler-D\u00fcnner and H. Pozidis. 2019. Breadth-first Depth-next Training of Random Forests. ArXiv abs\/1910.06853 (2019)."},{"key":"e_1_3_2_1_2_1","first-page":"1","article-title":"Resampling fewer than n observations: Gains, losses, and remedies for losses","volume":"7","author":"Bickel P.J.","year":"1997","unstructured":"P.J. Bickel, F. G\u00f6tze, and W.R. Van Zwet. 1997. Resampling fewer than n observations: Gains, losses, and remedies for losses. Statistica Sinica 7, 1 (1997), 1--31.","journal-title":"Statistica Sinica"},{"key":"e_1_3_2_1_3_1","article-title":"Emerging NVM: A Survey on Architectural Integration and Research Challenges","volume":"23","author":"Boukhobza J.","year":"2018","unstructured":"J. Boukhobza, S. Rubini, R. Chen, and Z. Shao. 2018. Emerging NVM: A Survey on Architectural Integration and Research Challenges. ACM Trans. Design Autom. Electr. Syst. 23, 2 (2018), 14:1--14:32.","journal-title":"ACM Trans. Design Autom. Electr. Syst."},{"key":"e_1_3_2_1_4_1","volume-title":"Random Forests. Machine Learning 45, 1","author":"Breiman L.","year":"2001","unstructured":"L. Breiman. 2001. Random Forests. Machine Learning 45, 1 (2001)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2014.2325029"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"J. Gantz D. Reinsel and J. Rydning. 2018. The Digitization of the World from Edge to Core. (2018) 28.","DOI":"10.12968\/nuwa.2018.17.28"},{"key":"e_1_3_2_1_7_1","unstructured":"D. Dua and C. Graff. 2017. UCI Machine Learning Repository."},{"volume-title":"Replanting Your Forest: NVM-friendly Bagging Strategy for Random Forest. In 2019 IEEE Non-Volatile Memory Systems and Applications Symposium.","author":"Ho Y. T.","key":"e_1_3_2_1_8_1","unstructured":"Y. T. Ho, C. Wu, M. Yang, T. Chen, and Y. Chang. 2019. Replanting Your Forest: NVM-friendly Bagging Strategy for Random Forest. In 2019 IEEE Non-Volatile Memory Systems and Applications Symposium."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"A. Kleiner A. Talwalkar P. Sarkar and M.I. Jordan. 2014. A scalable bootstrap for massive data. Journal of the Royal Statistical Society. Series B: Statistical Methodology 76 4 (2014).","DOI":"10.1111\/rssb.12050"},{"volume-title":"2019 IEEE International Parallel and Distributed Processing Symposium Workshops.","author":"Kukreja N.","key":"e_1_3_2_1_10_1","unstructured":"N. Kukreja, A. Shilova, O. Beaumont, J. Huckelheim, N. Ferrier, P. Hovland, and G. Gorman. 2019. Training on the Edge: The why and the how. In 2019 IEEE International Parallel and Distributed Processing Symposium Workshops."},{"key":"e_1_3_2_1_11_1","unstructured":"M. Kumari and S. Godara. 2011. Comparative Study of Data Mining Classification Methods in Cardiovascular Disease Prediction 1."},{"key":"e_1_3_2_1_12_1","unstructured":"P. Menage. 2004. CGROUPS. https:\/\/www.kernel.org\/doc\/Documentation\/cgroup-v1\/cgroups.txt last accessed on 28\/07\/20."},{"volume-title":"Proceedings of the 56th Annual Design Automation Conference (DAC '19)","author":"Mutlu O.","key":"e_1_3_2_1_13_1","unstructured":"O. Mutlu, S. Ghose, J. G\u00f6mez-Luna, and R. Ausavarungnirun. 2019. Enabling Practical Processing in and near Memory for Data-Intensive Computing. In Proceedings of the 56th Annual Design Automation Conference (DAC '19). ACM."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2019.01.009"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"J. Qiu Q. Wu G. Ding Y. Xu and S. Feng. 2016. A survey of machine learning for big data processing. EURASIP Journal on Advances in Signal Processing (2016).","DOI":"10.1186\/s13634-016-0355-x"},{"key":"e_1_3_2_1_17_1","unstructured":"D. Rosenberg. 2015. Bagging and Random Forests."},{"volume-title":"2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems. 262--268","author":"Slimani C.","key":"e_1_3_2_1_18_1","unstructured":"C. Slimani, S. Rubini, and J. Boukhobza. 2019. K -MLIO: Enabling K -Means for Large Data-Sets and Memory Constrained Embedded Systems. In 2019 IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems. 262--268."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"A. Verikas A. Gelzinis and M. Bacauskiene. 2011. Mining data with random forests: A survey and results of new tests. Pattern Recognition 44 (2011).","DOI":"10.1016\/j.patcog.2010.08.011"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"M. Wright and A. Ziegler. 2017. ranger: A Fast Implementation of Random Forests for High Dimensional Data in C++ and R. Journal of Statistical Software Articles 77 (2017).","DOI":"10.18637\/jss.v077.i01"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"C. Zhang and Y. Ma. 2012. Ensemble machine learning: methods and applications. Springer.","DOI":"10.1007\/978-1-4419-9326-7"}],"event":{"name":"SAC '21: The 36th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Virtual Event Republic of Korea","acronym":"SAC '21"},"container-title":["Proceedings of the 36th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3412841.3441932","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3412841.3441932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:23Z","timestamp":1750197743000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3412841.3441932"}},"subtitle":["a random forest I\/O-aware algorithm"],"short-title":[],"issued":{"date-parts":[[2021,3,22]]},"references-count":21,"alternative-id":["10.1145\/3412841.3441932","10.1145\/3412841"],"URL":"https:\/\/doi.org\/10.1145\/3412841.3441932","relation":{},"subject":[],"published":{"date-parts":[[2021,3,22]]},"assertion":[{"value":"2021-04-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}