Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Beslutsträd× | Stacking× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1984 | 1992 |
| Upphovsperson≠ | Breiman, Friedman, Olshen & Stone | Wolpert, D.H. |
| Typ≠ | Recursive partitioning (if-then rules) | Ensemble (heterogeneous meta-learning) |
| Ursprungskälla≠ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ | Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗ |
| Alias | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner |
| Närliggande | 5 | 5 |
| Sammanfattning≠ | 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. | Stacking, or stacked generalization, is an ensemble method introduced by David Wolpert in 1992 that combines the outputs of several different base models (Level-0) through a separate meta-model (Level-1). Unlike bagging and boosting, it deliberately uses heterogeneous model types, and it is the standard final-stage strategy in Kaggle competitions. |
| ScholarGateDatamängd ↗ |
|
|