방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 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데이터셋 ↗ |
|
|