Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Ensemble Naive Bayes× | Naive Bayes× | Random Forest× | |
|---|---|---|---|
| Obor | Strojové učení | Strojové učení | Strojové učení |
| Rodina | Machine learning | Machine learning | Machine learning |
| Rok vzniku≠ | 2000s | 1997 | 2001 |
| Tvůrce≠ | Various (Dietterich, T.G.; Webb, G.I.; others) | Mitchell, T. M. (textbook treatment) | Breiman, L. |
| Typ≠ | Ensemble of probabilistic classifiers | Probabilistic classifier (Bayes' theorem with conditional independence) | Ensemble (bagging of decision trees) |
| Původní zdroj≠ | Dietterich, T. G. (2000). Ensemble Methods in Machine Learning. In J. Kittler & F. Roli (Eds.), Multiple Classifier Systems (MCS 2000), Lecture Notes in Computer Science, vol. 1857, pp. 1–15. Springer. DOI ↗ | Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. ISBN: 978-0070428072 | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Další názvy≠ | Bagged Naive Bayes, Boosted Naive Bayes, Naive Bayes ensemble, NB ensemble | Naive Bayes Sınıflandırıcı, naive bayes classifier, simple Bayes, Gaussian Naive Bayes | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Příbuzné≠ | 6 | 4 | 4 |
| Shrnutí≠ | Ensemble Naive Bayes trains multiple Naive Bayes classifiers — each exposed to a different view of the data through bagging, feature subsets, or boosting — and combines their probabilistic predictions by voting or probability averaging. The approach retains the speed and interpretability of individual Naive Bayes models while reducing variance and improving accuracy through ensemble aggregation. | 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. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGateDatová sada ↗ |
|
|
|