Comparar métodos
Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.
| Agregación por Bootstrap (Bagging)× | Árbol de Decisión× | |
|---|---|---|
| Campo | Aprendizaje automático | Aprendizaje automático |
| Familia | Machine learning | Machine learning |
| Año de origen≠ | 1996 | 1984 |
| Autor original≠ | Breiman, L. | Breiman, Friedman, Olshen & Stone |
| Tipo≠ | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) | Recursive partitioning (if-then rules) |
| Fuente seminal≠ | 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 ↗ |
| Alias | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree |
| Relacionados | 5 | 5 |
| Resumen≠ | 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. |
| ScholarGateConjunto de datos ↗ |
|
|