方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 鲁棒度量学习× | 鲁棒支持向量机× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2009–2012 | 2006–2009 |
| 提出者≠ | Various (Weinberger, Saul, Schultz et al.; robust extensions by Shen, Cao and others, 2009–2012) | Xu, H., Caramanis, C., & Mannor, S. |
| 类型≠ | Supervised/semi-supervised distance metric learning with robustness to noise and outliers | Robust supervised classifier / regressor |
| 开创性文献≠ | Shen, C., Kim, J., Wang, L., & van den Hengel, A. (2012). Positive Semidefinite Metric Learning Using Boosting-like Algorithms. Journal of Machine Learning Research, 13, 1007–1036. link ↗ | Xu, H., Caramanis, C., & Mannor, S. (2009). Robustness and regularization of support vector machines. Journal of Machine Learning Research, 10, 1485–1510. link ↗ |
| 别名 | robust distance metric learning, noise-robust metric learning, outlier-robust similarity learning, robust DML | Robust SVM, RSVM, noise-tolerant SVM, outlier-robust SVM |
| 相关 | 5 | 5 |
| 摘要≠ | Robust Metric Learning learns a Mahalanobis distance function from labeled or pairwise-constrained data while actively resisting the distortion caused by noisy labels, corrupted examples, or outliers. By replacing standard hinge or squared losses with robust alternatives and adding regularization, it produces a distance metric that generalises well even when the training set is imperfect — a common situation in real-world scientific and applied tasks. | Robust SVM extends the standard support vector machine to resist the influence of outliers and mislabeled points. By replacing the hinge loss with a bounded or non-convex loss function — or by incorporating robust optimization constraints — it learns a decision boundary that is far less distorted by corrupted training examples, making it suitable for noisy real-world datasets where standard SVM would degrade significantly. |
| ScholarGate数据集 ↗ |
|
|