{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T17:12:19Z","timestamp":1777569139744,"version":"3.51.4"},"reference-count":34,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T00:00:00Z","timestamp":1753056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52307232"],"award-info":[{"award-number":["52307232"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2024JJ4055"],"award-info":[{"award-number":["2024JJ4055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hunan Provincial Natural Science Foundation of China","award":["52307232"],"award-info":[{"award-number":["52307232"]}]},{"name":"Hunan Provincial Natural Science Foundation of China","award":["2024JJ4055"],"award-info":[{"award-number":["2024JJ4055"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["MAKE"],"abstract":"<jats:p>Random Forests are powerful machine learning models widely applied in classification and regression tasks due to their robust predictive performance. Nevertheless, traditional Random Forests face computational challenges during tree construction, particularly in high-dimensional data or on resource-constrained devices. In this paper, a novel node-splitting algorithm, BayesSplit, is proposed to accelerate decision tree construction via a Bayesian-based impurity estimation framework. BayesSplit treats impurity reduction as a Bernoulli event with Beta-conjugate priors for each split point and incorporates two main strategies. First, Dynamic Posterior Parameter Refinement updates the Beta parameters based on observed impurity reductions in batch iterations. Second, Posterior-Derived Confidence Bounding establishes statistical confidence intervals, efficiently filtering out suboptimal splits. Theoretical analysis demonstrates that BayesSplit converges to optimal splits with high probability, while experimental results show up to a 95% reduction in training time compared to baselines and maintains or exceeds generalization performance. Compared to the state-of-the-art MABSplit, BayesSplit achieves similar accuracy on classification tasks and reduces regression training time by 20\u201370% with lower MSEs. Furthermore, BayesSplit enhances feature importance stability by up to 40%, making it particularly suitable for deployment in computationally constrained environments.<\/jats:p>","DOI":"10.3390\/make7030070","type":"journal-article","created":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T13:59:11Z","timestamp":1753106351000},"page":"70","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient and Accurate Random Forest Node-Splitting Algorithm Based on Dynamic Bayesian Methods"],"prefix":"10.3390","volume":"7","author":[{"given":"Jun","family":"He","sequence":"first","affiliation":[{"name":"School of Physics, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhanqi","family":"Li","sequence":"additional","affiliation":[{"name":"School of Electronic Information, Central South University, Changsha 410075, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8137-1273","authenticated-orcid":false,"given":"Linzi","family":"Yin","sequence":"additional","affiliation":[{"name":"School of Electronic Information, Central South University, Changsha 410075, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,7,21]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.knosys.2016.07.016","article-title":"Optimizing the Number of Trees in a Decision Forest to Discover a Subforest with High Ensemble Accuracy Using a Genetic Algorithm","volume":"110","author":"Adnan","year":"2016","journal-title":"Knowl.-Based Syst."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","article-title":"Random Forests","volume":"45","author":"Breiman","year":"2001","journal-title":"Mach. Learn."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.neucom.2022.08.055","article-title":"Evolutionary Bagging for Ensemble Learning","volume":"510","author":"Ngo","year":"2022","journal-title":"Neurocomputing"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.knosys.2017.07.019","article-title":"A Random Forest Approach Using Imprecise Probabilities","volume":"134","author":"Mantas","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1109\/TCBB.2018.2871674","article-title":"Efficiently Predicting Hot Spots in PPIs by Combining Random Forest and Synthetic Minority Over-Sampling Technique","volume":"16","author":"Zhang","year":"2018","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2226","DOI":"10.1109\/TMM.2022.3144890","article-title":"PhotoHelper: Portrait Photographing Guidance via Deep Feature Retrieval and Fusion","volume":"25","author":"Jiang","year":"2022","journal-title":"IEEE Trans. Multimed."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1049\/cit2.12067","article-title":"Research on Stock Trend Prediction Method Based on Optimized Random Forest","volume":"8","author":"Yin","year":"2023","journal-title":"CAAI Trans. Intell. Technol."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Wang, X., Du, S., Feng, C.C., Zhang, X., and Zhang, X. (2018). Interpreting the Fuzzy Semantics of Natural-Language Spatial Relation Terms with the Fuzzy Random Forest Algorithm. ISPRS Int. J. Geo-Inf., 7.","DOI":"10.3390\/ijgi7020058"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.ins.2020.12.067","article-title":"FastForest: Increasing Random Forest Processing Speed While Maintaining Accuracy","volume":"557","author":"Yates","year":"2021","journal-title":"Inf. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"100813","DOI":"10.1016\/j.iot.2023.100813","article-title":"A Flexible and Efficient FPGA-Based Random Forest Architecture for IoT Applications","volume":"22","author":"Dinh","year":"2023","journal-title":"Internet Things"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"121549","DOI":"10.1016\/j.eswa.2023.121549","article-title":"An Improved Random Forest Based on the Classification Accuracy and Correlation Measurement of Decision Trees","volume":"237","author":"Sun","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"105138","DOI":"10.1016\/j.engappai.2022.105138","article-title":"Depth-First Random Forests with Improved Grassberger Entropy for Small Object Detection","volume":"114","author":"Ma","year":"2022","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1186\/s40537-023-00874-6","article-title":"Data-Driven Multinomial Random Forest: A New Random Forest Variant with Strong Consistency","volume":"11","author":"Chen","year":"2024","journal-title":"J. Big Data"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"4145","DOI":"10.1007\/s00366-021-01393-9","article-title":"Performance Evaluation of Hybrid WOA-XGBoost, GWO-XGBoost and BO-XGBoost Models to Predict Blast-Induced Ground Vibration","volume":"38","author":"Qiu","year":"2022","journal-title":"Eng. Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2326","DOI":"10.1109\/TSG.2019.2892595","article-title":"Energy Theft Detection Using Gradient Boosting Theft Detector with Feature Engineering-Based Preprocessing","volume":"10","author":"Punmiya","year":"2019","journal-title":"IEEE Trans. Smart Grid"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40537-019-0232-1","article-title":"Random Forest Implementation and Optimization for Big Data Analytics on LexisNexis\u2019s High Performance Computing Cluster Platform","volume":"6","author":"Herrera","year":"2019","journal-title":"J. Big Data"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1109\/TPDS.2016.2603511","article-title":"A Parallel Random Forest Algorithm for Big Data in a Spark Cloud Computing Environment","volume":"28","author":"Chen","year":"2017","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Domingos, P., and Hulten, G. (2000, January 20\u201323). Mining High-Speed Data Streams. Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, USA.","DOI":"10.1145\/347090.347107"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Manapragada, C., Webb, G.I., and Salehi, M. (2018, January 19\u201323). Extremely Fast Decision Tree. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, London, UK.","DOI":"10.1145\/3219819.3220005"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.ins.2017.12.059","article-title":"A Pearson\u2019s Correlation Coefficient Based Decision Tree and Its Parallel Implementation","volume":"435","author":"Mu","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Xu, Y. (2017, January 18\u201319). Research and Implementation of Improved Random Forest Algorithm Based on Spark. Proceedings of the 2nd IEEE International Conference on Big Data Analytics, Chengdu, China.","DOI":"10.1109\/ICBDA.2017.8078683"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Yin, L., Chen, K., Jiang, Z., and Xu, X. (2023). A Fast Parallel Random Forest Algorithm Based on Spark. Appl. Sci., 13.","DOI":"10.3390\/app13106121"},{"key":"ref_23","unstructured":"Tiwari, M., Kang, R., Lee, J., Piech, C., Shomorony, I., Thrun, S., and Zhang, M.J. (2022, January 6\u201312). MABSplit: Faster Forest Training Using Multi-Armed Bandits. Proceedings of the Advances in Neural Information Processing Systems, New Orleans, LA, USA."},{"key":"ref_24","unstructured":"Li, X., Wang, Y., Basu, S., Kumbier, K., and Yu, B. (2019, January 8\u201314). A Debiased MDI Feature Importance Measure for Random Forests. Proceedings of the Advances in Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., and Stone, C.J. (2017). Classification and Regression Trees, Routledge.","DOI":"10.1201\/9781315139470"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1287\/moor.2014.0650","article-title":"Learning to Optimize via Posterior Sampling","volume":"39","author":"Russo","year":"2014","journal-title":"Math. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.neucom.2020.01.086","article-title":"Self-Accelerated Thompson Sampling with Near-Optimal Regret Upper Bound","volume":"399","author":"Zhu","year":"2020","journal-title":"Neurocomputing"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000070","article-title":"A Tutorial on Thompson Sampling","volume":"11","author":"Russo","year":"2018","journal-title":"Found. Trends Mach. Learn."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.fss.2019.01.021","article-title":"A Modified Kullback\u2013Leibler Divergence for Non-Additive Measures Based on Choquet Integral","volume":"367","author":"Agahi","year":"2019","journal-title":"Fuzzy Sets Syst."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"107284","DOI":"10.1016\/j.ress.2020.107284","article-title":"Fault Diagnosis Based on Extremely Randomized Trees in Wireless Sensor Networks","volume":"205","author":"Saeed","year":"2021","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1597","DOI":"10.1007\/s10115-021-01579-z","article-title":"Learning from Evolving Data Streams Through Ensembles of Random Patches","volume":"63","author":"Gomes","year":"2021","journal-title":"Knowl. Inf. Syst."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Alduailij, M., Khan, Q.W., Tahir, M., Sardaraz, M., Alduailij, M., and Malik, F. (2022). Machine-Learning-Based DDoS Attack Detection Using Mutual Information and Random Forest Feature Importance Method. Symmetry, 14.","DOI":"10.3390\/sym14061095"},{"key":"ref_33","first-page":"1","article-title":"On the Stability of Feature Selection Algorithms","volume":"18","author":"Nogueira","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1109\/TIT.1970.1054466","article-title":"Probability of Error, Equivocation, and the Chernoff Bound","volume":"16","author":"Hellman","year":"1970","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Machine Learning and Knowledge Extraction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-4990\/7\/3\/70\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:13:22Z","timestamp":1760033602000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-4990\/7\/3\/70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,21]]},"references-count":34,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["make7030070"],"URL":"https:\/\/doi.org\/10.3390\/make7030070","relation":{},"ISSN":["2504-4990"],"issn-type":[{"value":"2504-4990","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,21]]}}}