방법 비교

	Regularized Random Forest	정규화된 결정 트리
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2012	1984
창시자	Deng, H. & Runger, G.	Breiman, L., Friedman, J., Olshen, R., & Stone, C.
유형	Regularized ensemble (penalized feature selection in trees)	Supervised learning (regularized tree)
원전	Deng, H., & Runger, G. (2012). Feature selection via regularized trees. Proceedings of the 2012 International Joint Conference on Neural Networks (IJCNN), IEEE, pp. 1–8.	Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984). Classification and Regression Trees. Wadsworth. ISBN: 978-0-412-04841-8
별칭	RRF, Guided Regularized Random Forest, GRRF, regularized tree ensemble	pruned decision tree, cost-complexity pruned tree, penalized decision tree, constrained CART
관련	5	6
요약	Regularized Random Forest (RRF), introduced by Deng and Runger in 2012, extends the standard Random Forest by adding a penalty that discourages splits on features not already used in the ensemble. This built-in regularization produces sparser, less redundant feature subsets, making the model especially valuable when feature selection is as important as predictive accuracy.	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.