방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 정규화 나이브 베이즈× | 정규화 로지스틱 회귀× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1950s–2003 | 1996–2005 |
| 창시자≠ | Good, I. J. (Laplace smoothing formalized); Rennie et al. (complement regularization) | Tibshirani, R. (lasso); Hoerl & Kennard (ridge); Zou & Hastie (elastic net) |
| 유형≠ | Probabilistic classifier with regularization | Penalized classification model |
| 원전≠ | Rennie, J. D. M., Shih, L., Teevan, J., & Karger, D. R. (2003). Tackling the poor assumptions of Naive Bayes text classifiers. In Proceedings of the 20th International Conference on Machine Learning (ICML-2003), pp. 616–623. link ↗ | Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ |
| 별칭 | Smoothed Naive Bayes, Laplace-smoothed Naive Bayes, Regularized NB, Complement Naive Bayes | penalized logistic regression, L1 logistic regression, L2 logistic regression, elastic net logistic regression |
| 관련≠ | 4 | 5 |
| 요약≠ | Regularized Naive Bayes augments the classical Naive Bayes probabilistic classifier with explicit smoothing or shrinkage — most commonly Laplace (additive) smoothing — to prevent zero-probability estimates for unseen feature values and to reduce overfitting. The result is a fast, robust classifier that generalizes better than unsmoothed Naive Bayes, particularly on sparse or high-dimensional data such as text. | Regularized logistic regression extends standard logistic regression by adding an L1 (lasso), L2 (ridge), or elastic net penalty to the log-likelihood, shrinking coefficients toward zero and preventing overfitting. It is the default choice for binary or multinomial classification when you want interpretable, sparse, or stable coefficient estimates in high-dimensional or collinear feature spaces. |
| ScholarGate데이터셋 ↗ |
|
|