قارن الطرق
راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.
| الأشجار الإضافية (Extra Trees)× | شجرة القرار (Decision Tree)× | تعزيز التدرج× | |
|---|---|---|---|
| المجال | تعلم الآلة | تعلم الآلة | تعلم الآلة |
| العائلة | Machine learning | Machine learning | Machine learning |
| سنة النشأة≠ | 2006 | 1984 | 2001 |
| صاحب الطريقة≠ | Geurts, P.; Ernst, D.; Wehenkel, L. | Breiman, Friedman, Olshen & Stone | Friedman, J. H. |
| النوع≠ | Ensemble (extremely randomized decision trees) | Recursive partitioning (if-then rules) | Ensemble (sequential boosting of decision trees) |
| المصدر التأسيسي≠ | Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ |
| الأسماء البديلة≠ | Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine |
| ذات صلة | 5 | 5 | 5 |
| الملخص≠ | 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. | 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. |
| ScholarGateمجموعة البيانات ↗ |
|
|
|