Sammenlign metoder
Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.
| Regulert beslutningstre× | Beslutningstre× | |
|---|---|---|
| Fagfelt | Maskinlæring | Maskinlæring |
| Familie | Machine learning | Machine learning |
| Opprinnelsesår | 1984 | 1984 |
| Opphavsperson≠ | Breiman, L., Friedman, J., Olshen, R., & Stone, C. | Breiman, Friedman, Olshen & Stone |
| Type≠ | Supervised learning (regularized tree) | Recursive partitioning (if-then rules) |
| Opprinnelig kilde≠ | Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984). Classification and Regression Trees. Wadsworth. ISBN: 978-0-412-04841-8 | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ |
| Alias≠ | pruned decision tree, cost-complexity pruned tree, penalized decision tree, constrained CART | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree |
| Relaterte≠ | 6 | 5 |
| Sammendrag≠ | A regularized decision tree is a decision tree model whose complexity is intentionally limited through pruning, depth constraints, or penalty terms to prevent overfitting. Rooted in Breiman et al.'s CART framework (1984), regularization converts the greedy tree-growing procedure into a bias-variance tradeoff, yielding models that generalize better to unseen data than fully-grown trees. | 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. |
| ScholarGateDatasett ↗ |
|
|