Uporedite metode
Pregledajte izabrane metode jednu pored druge; redovi koji se razlikuju su istaknuti.
| Metode zasnovane na stablu odluke sa sklopom (Ensemble Decision Tree)× | Bagging (Bootstrap Aggregating)× | Boosting× | |
|---|---|---|---|
| Oblast | Mašinsko učenje | Mašinsko učenje | Mašinsko učenje |
| Porodica | Machine learning | Machine learning | Machine learning |
| Godina nastanka≠ | 1996–2000 | 1996 | 1990–1997 |
| Tvorac≠ | Breiman, L.; Dietterich, T. G. | Breiman, L. | Schapire, R. E.; Freund, Y. |
| Tip≠ | Ensemble (multiple decision trees combined) | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) | Sequential ensemble (iterative reweighting) |
| Temeljni izvor≠ | Dietterich, T. G. (2000). Ensemble methods in machine learning. In Multiple Classifier Systems, Lecture Notes in Computer Science, vol. 1857, pp. 1–15. Springer, Berlin, Heidelberg. DOI ↗ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ | Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗ |
| Drugi nazivi≠ | decision tree ensemble, ensemble of decision trees, combined decision trees, multiple classifier system (decision trees) | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble |
| Srodne≠ | 6 | 5 | 6 |
| Sažetak≠ | Ensemble Decision Tree methods train multiple decision trees and combine their outputs to produce predictions that are more accurate and stable than any single tree. Covering strategies such as bagging, random subspacing, and voting, they are among the most effective off-the-shelf techniques for tabular classification and regression tasks. | 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. | Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy. |
| ScholarGateSkup podataka ↗ |
|
|
|