Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Бустинг× | Наївний Байєс× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1990–1997 | 1997 |
| Автор методу≠ | Schapire, R. E.; Freund, Y. | Mitchell, T. M. (textbook treatment) |
| Тип≠ | Sequential ensemble (iterative reweighting) | Probabilistic classifier (Bayes' theorem with conditional independence) |
| Основоположне джерело≠ | Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗ | Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072 |
| Інші назви≠ | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble | Naive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes |
| Пов'язані≠ | 6 | 4 |
| Підсумок≠ | Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy. | 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. |
| ScholarGateНабір даних ↗ |
|
|