방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 부스팅× | 나이브 베이즈× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | 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데이터셋 ↗ |
|
|