Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Naive Bayes Regularizat× | Naive Bayes× | |
|---|---|---|
| Domeniu | Învățare automată | Învățare automată |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 1950s–2003 | 1997 |
| Autorul original≠ | Good, I. J. (Laplace smoothing formalized); Rennie et al. (complement regularization) | Mitchell, T. M. (textbook treatment) |
| Tip≠ | Probabilistic classifier with regularization | Probabilistic classifier (Bayes' theorem with conditional independence) |
| Sursa seminală≠ | 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 ↗ | Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072 |
| Denumiri alternative≠ | Smoothed Naive Bayes, Laplace-smoothed Naive Bayes, Regularized NB, Complement Naive Bayes | Naive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes |
| Înrudite | 4 | 4 |
| Rezumat≠ | 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. | Naive Bayes is a fast probabilistic classifier that applies Bayes' theorem while assuming that the features are conditionally independent given the class — a method given its standard machine-learning treatment in Tom Mitchell's 1997 textbook Machine Learning. Despite this simplifying ('naive') assumption, it is quick to train and often surprisingly accurate. |
| ScholarGateSet de date ↗ |
|
|