השוואת שיטות

	רגרסיה לוגיסטית (למידת מכונה)	רגרסיה לוגיסטית עם רגולריזציה
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1958	1996–2005
הוגה השיטה	Cox, D. R.	Tibshirani, R. (lasso); Hoerl & Kennard (ridge); Zou & Hastie (elastic net)
סוג	Probabilistic linear classifier	Penalized classification model
מקור מכונן	Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242.	Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288.
כינויים	logit model, logit regression, binomial logistic regression, maximum entropy classifier	penalized logistic regression, L1 logistic regression, L2 logistic regression, elastic net logistic regression
קשורות	5	5
תקציר	Logistic regression is a foundational probabilistic classifier that models the log-odds of a binary (or multinomial) outcome as a linear function of the predictors. Introduced by D. R. Cox in 1958, it remains one of the most widely used and interpretable classification methods in both statistics and machine learning, valued for its calibrated probability outputs and clear coefficient interpretation.	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.