Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Bagging (Bootstrap Aggregating)× | Дерево рішень× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1996 | 1984 |
| Автор методу≠ | Breiman, L. | Breiman, Friedman, Olshen & Stone |
| Тип≠ | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) | Recursive partitioning (if-then rules) |
| Основоположне джерело≠ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ |
| Інші назви | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree |
| Пов'язані | 5 | 5 |
| Підсумок≠ | 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. |
| ScholarGateНабір даних ↗ |
|
|