Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Pohon Keputusan× | Pokok Tambahan× | |
|---|---|---|
| Bidang | Pembelajaran Mesin | Pembelajaran Mesin |
| Keluarga | Machine learning | Machine learning |
| Tahun asal≠ | 1984 | 2006 |
| Pengasas≠ | Breiman, Friedman, Olshen & Stone | Geurts, P.; Ernst, D.; Wehenkel, L. |
| Jenis≠ | Recursive partitioning (if-then rules) | Ensemble (extremely randomized decision trees) |
| Sumber perintis≠ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ | Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42. DOI ↗ |
| Alias≠ | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET |
| Berkaitan | 5 | 5 |
| Ringkasan≠ | 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. | Extra Trees (Extremely Randomized Trees), introduced by Geurts, Ernst, and Wehenkel in 2006, is an ensemble of decision trees that pushes randomisation further than Random Forest. Both the candidate features and the split thresholds are chosen completely at random at each node, eliminating the greedy search over thresholds. This extra randomness reduces variance, often matches or exceeds Random Forest accuracy, and runs substantially faster at training time. |
| ScholarGateSet data ↗ |
|
|