方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 贝叶斯 k-近邻算法× | 随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2002 | 2001 |
| 提出者≠ | Holmes, C. C. & Adams, N. M. | Breiman, L. |
| 类型≠ | Probabilistic instance-based classifier | Ensemble (bagging of decision trees) |
| 开创性文献≠ | Holmes, C. C., & Adams, N. M. (2002). A probabilistic nearest neighbour method for statistical pattern recognition. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 64(2), 295–306. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名 | Bayesian KNN, BKNN, probabilistic k-nearest neighbors, Bayesian nearest-neighbor classifier | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关≠ | 3 | 4 |
| 摘要≠ | Bayesian k-Nearest Neighbors (Bayesian KNN) extends the classical KNN algorithm by placing a prior distribution over the neighborhood size k and combining likelihood evidence from neighbors with that prior to produce calibrated posterior class probabilities. It retains KNN's intuitive instance-based logic while adding principled uncertainty quantification over predictions. | 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数据集 ↗ |
|
|