Compară metode

	Arbore de decizie regularizat	Pădurea Aleatoare (Random Forest)
Domeniu	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning
Anul apariției	1984	2001
Autorul original	Breiman, L., Friedman, J., Olshen, R., & Stone, C.	Breiman, L.
Tip	Supervised learning (regularized tree)	Ensemble (bagging of decision trees)
Sursa seminală	Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984). Classification and Regression Trees. Wadsworth. ISBN: 978-0-412-04841-8	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Denumiri alternative	pruned decision tree, cost-complexity pruned tree, penalized decision tree, constrained CART	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Înrudite	6	4
Rezumat	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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.