Machine learningMachine learning

Regularized Random Forest

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.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. 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. DOI: 10.1109/IJCNN.2012.6252640
  2. Deng, H., & Runger, G. (2013). Gene selection with guided regularized random forest. Pattern Recognition, 46(12), 3483–3489. DOI: 10.1016/j.patcog.2013.05.018

Related methods

Referenced by

ScholarGateRegularized random forest (Regularized Random Forest (RRF)). Retrieved 2026-06-04 from https://scholargate.app/en/machine-learning/regularized-random-forest