So sánh phương pháp

	Extra Trees	Bagging (Bootstrap Aggregating)	Cây Quyết định	Gradient Boosting	Rừng ngẫu nhiên
Lĩnh vực	Học máy	Học máy	Học máy	Học máy	Học máy
Họ	Machine learning	Machine learning	Machine learning	Machine learning	Machine learning
Năm ra đời	2006	1996	1984	2001	2001
Người khởi xướng	Geurts, P.; Ernst, D.; Wehenkel, L.	Breiman, L.	Breiman, Friedman, Olshen & Stone	Friedman, J. H.	Breiman, L.
Loại	Ensemble (extremely randomized decision trees)	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)	Recursive partitioning (if-then rules)	Ensemble (sequential boosting of decision trees)	Ensemble (bagging of decision trees)
Công trình gốc	Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.	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.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Tên gọi khác	Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Liên quan	5	5	5	5	4
Tóm tắt	Extra Trees (Extremely Randomized Trees), introduced by Geurts, Ernst, and Wehenkel in 2006, is an ensemble of decision trees that pushes randomisation further than Random Forest. Both the candidate features and the split thresholds are chosen completely at random at each node, eliminating the greedy search over thresholds. This extra randomness reduces variance, often matches or exceeds Random Forest accuracy, and runs substantially faster at training time.	Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner.	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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.