השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| נאיבי בייס מרובע× | מכונת וקטורים תומכים מווסתת (Regularized Support Vector Machine)× | |
|---|---|---|
| תחום | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning |
| שנת המקור≠ | 1950s–2003 | 1995–2004 |
| הוגה השיטה≠ | Good, I. J. (Laplace smoothing formalized); Rennie et al. (complement regularization) | Cortes, C. & Vapnik, V. (soft-margin SVM); Zhu et al. (L1-SVM) |
| סוג≠ | Probabilistic classifier with regularization | Regularized discriminative classifier / regressor |
| מקור מכונן≠ | 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 ↗ | Cortes, C. & Vapnik, V. (1995). Support-vector networks. Machine Learning, 20(3), 273–297. DOI ↗ |
| כינויים | Smoothed Naive Bayes, Laplace-smoothed Naive Bayes, Regularized NB, Complement Naive Bayes | Regularized SVM, L1-SVM, L2-SVM, penalized SVM |
| קשורות | 4 | 4 |
| תקציר≠ | 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 Support Vector Machine extends the classic SVM by explicitly controlling the trade-off between margin maximization and training error through an L1 or L2 penalty parameter. The soft-margin formulation introduced by Cortes and Vapnik in 1995 is itself a regularized model, and later L1-SVM variants additionally promote feature sparsity, enabling automatic variable selection in high-dimensional settings. |
| ScholarGateמערך נתונים ↗ |
|
|