- 期刊
- OpenAccess
Predictive Comparison Between Random Machines and Random Forests
摘要
Ensemble techniques have been gaining strength among machine learning models, considering supervised tasks, due to their great predictive capacity when compared with some traditional approaches. The random forest is considered to be one of the off-the-shelf algorithms due to its flexibility and robust performance to both regression and classification tasks. In this paper, the random machines method is applied over simulated data sets and benchmarking datasets in order to be compared with the consolidated random forest models. The results from simulated models show that the random machines method has a better predictive performance than random forest in most of the investigated data sets. Three real data situations demonstrate that the random machines may be used to solve real-world problems with competitive payoff.
延伸閱讀
- 簡均翰 (2013). Random Decomposition Forests [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-2511201311364581
- Wu, Y. J. (2022). A Permutation-Based Feature Selection (PBFS) Approach Using Random Forests [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU202104467
- Yang, F., Yang, R., & Zhang, Z. (2023). Research and Application based on Random Forest and BP Neural Network. International Core Journal of Engineering, 9(6), 89-95. https://doi.org/10.6919/ICJE.202306_9(6).0012
- Gaugler, T., & Akritas, M. G. (2013). Testing for Main Random Effects in Two-Way Random and Mixed Effects Models: Modifying the F Statistic. Journal of Probability and Statistics, 2013(), 243-253. https://doi.org/10.1155/2013/708540
- 陳伯杰（2022）。Comparison of RandomForest and XGBoost in Forecasting Robustness〔碩士論文，淡江大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0002-1508202202092900