เปรียบเทียบวิธี

	Random Forest ที่ทนทาน	ต้นไม้ตัดสินใจ	การเสริมกำลังไล่ระดับ
สาขาวิชา	การเรียนรู้ของเครื่อง	การเรียนรู้ของเครื่อง	การเรียนรู้ของเครื่อง
ตระกูล	Machine learning	Machine learning	Machine learning
ปีกำเนิด	2000s–2010s	1984	2001
ผู้ริเริ่ม	Various (extensions of Breiman 2001 Random Forest)	Breiman, Friedman, Olshen & Stone	Friedman, J. H.
ประเภท	Robust Ensemble (noise-tolerant bagging of decision trees)	Recursive partitioning (if-then rules)	Ensemble (sequential boosting of decision trees)
แหล่งต้นตำรับ	Chen, S., & Guestrin, C. (2019). Robust Random Forest. In Proceedings of the 36th International Conference on Machine Learning (ICML). Also see: Gao, W., & Zhou, Z.-H. (2013). On the Doubt about Margin Explanation of Boosting. Artificial Intelligence, 203, 1–18.	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232.
ชื่อเรียกอื่น	RRF, noise-robust random forest, outlier-resistant random forest, robust ensemble forest	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
ที่เกี่ยวข้อง	6	5	5
สรุป	Robust Random Forest extends the standard Random Forest ensemble by incorporating mechanisms that reduce the influence of outliers, label noise, and corrupted observations. Rather than treating all training instances equally, it applies weighting or filtering strategies so that noisy or anomalous samples contribute less to individual tree splits, yielding predictions that remain reliable even when data quality is imperfect.	A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.	Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.