方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 集成度量学习× | 随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2000s–2010s | 2001 |
| 提出者≠ | Multiple contributors (Weinberger, Saul, et al.) | Breiman, L. |
| 类型≠ | Ensemble of learned distance metrics | Ensemble (bagging of decision trees) |
| 开创性文献≠ | Wang, J., Kalousis, A., & Woznica, A. (2012). Parametric local metric learning for nearest neighbor classification. Advances in Neural Information Processing Systems, 25. link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名 | EML, ensemble distance metric learning, multiple metric fusion, combined metric learning | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关≠ | 5 | 4 |
| 摘要≠ | Ensemble Metric Learning trains multiple distance metric learners — each on a different data view, feature subspace, or with a different objective — and combines the resulting metrics to produce a single, more robust similarity function. Combining diverse metrics reduces the variance of any individual metric and improves performance in tasks such as nearest-neighbor classification, retrieval, and few-shot learning. | 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数据集 ↗ |
|
|