השוואת שיטות

	בוסטינג	בייס נאיבי
תחום	למידת מכונה	למידת מכונה
משפחה	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.	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.