方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 正则化提升× | 正则化随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2001–2016 | 2012 |
| 提出者≠ | Friedman, J. H.; extended by Chen & Guestrin | Deng, H. & Runger, G. |
| 类型≠ | Regularized ensemble (boosting with shrinkage/penalty) | Regularized ensemble (penalized feature selection in trees) |
| 开创性文献≠ | Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | 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 ↗ |
| 别名 | shrinkage boosting, penalized boosting, regularized gradient boosting, L1/L2 boosting | RRF, Guided Regularized Random Forest, GRRF, regularized tree ensemble |
| 相关 | 5 | 5 |
| 摘要≠ | Regularized boosting extends gradient boosting by adding explicit controls — shrinkage (learning rate), L1/L2 weight penalties, subsampling, and tree-complexity limits — to the objective function and the update rule. These constraints reduce overfitting, stabilise the model on noisy or small datasets, and are the core reason why systems such as XGBoost and LightGBM consistently outperform vanilla boosting on real-world tabular benchmarks. | 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. |
| ScholarGate数据集 ↗ |
|
|