方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 集成朴素贝叶斯× | Bagging(Bootstrap Aggregating)× | 随机森林× | |
|---|---|---|---|
| 领域 | 机器学习 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning | Machine learning |
| 起源年份≠ | 2000s | 1996 | 2001 |
| 提出者≠ | Various (Dietterich, T.G.; Webb, G.I.; others) | Breiman, L. | Breiman, L. |
| 类型≠ | Ensemble of probabilistic classifiers | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) | Ensemble (bagging of decision trees) |
| 开创性文献≠ | 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 ↗ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名≠ | Bagged Naive Bayes, Boosted Naive Bayes, Naive Bayes ensemble, NB ensemble | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关≠ | 6 | 5 | 4 |
| 摘要≠ | 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. | Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner. | 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. |
| ScholarGate数据集 ↗ |
|
|
|