方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| MCP惩罚回归× | SCAD惩罚回归× | |
|---|---|---|
| 领域 | 心理测量学 | 心理测量学 |
| 方法族 | Latent structure | Latent structure |
| 起源年份≠ | 2010 | 2001 |
| 提出者≠ | Cun-Hui Zhang | Jianqing Fan, Runze Li |
| 类型≠ | Penalized regression with minimax concave penalty | Penalized regression with non-concave penalty |
| 开创性文献≠ | Zhang, C. H. (2010). Nearly unbiased variable selection under minimax concave penalty. Annals of Statistics, 38(2), 894-942. DOI ↗ | Fan, J., & Li, R. (2001). Variable selection via nonconcave penalized likelihood and its oracle properties. Journal of the American Statistical Association, 96(456), 1348-1360. DOI ↗ |
| 别名 | MCP | SCAD |
| 相关≠ | 4 | 5 |
| 摘要≠ | MCP (Minimax Concave Penalty) is a variable selection method developed by Zhang (2010) that uses a concave penalty function for automated feature selection. Like SCAD, MCP addresses bias in lasso by avoiding shrinkage of large coefficients, but uses a different penalty shape that is computationally simpler than SCAD. | SCAD (Smoothly Clipped Absolute Deviation) is a variable selection and regularization method developed by Fan and Li (2001) that addresses limitations of L1 penalization (lasso). SCAD uses a non-concave penalty that automatically performs variable selection while maintaining oracle properties: it recovers the true underlying model as if the true predictors were known in advance. |
| ScholarGate数据集 ↗ |
|
|