方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 在线度量学习× | 度量学习× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2004–2009 | 2003 (foundational); refined 2009 (LMNN) |
| 提出者≠ | Shalev-Shwartz, S.; Singer, Y.; and others | Xing, E. P.; Jordan, M. I.; Russell, S.; Ng, A. Y. |
| 类型≠ | Online / incremental learning of distance metrics | Representation learning / supervised distance optimization |
| 开创性文献≠ | Shalev-Shwartz, S., Singer, Y., & Ng, A. Y. (2004). Online and batch learning of pseudo-metrics. Proceedings of the 21st International Conference on Machine Learning (ICML 2004), pp. 94. ACM. link ↗ | Xing, E. P., Jordan, M. I., Russell, S., & Ng, A. Y. (2003). Distance metric learning with application to clustering with side-information. In Advances in Neural Information Processing Systems (NIPS), 16, 505–512. link ↗ |
| 别名 | OML, incremental metric learning, streaming metric learning, online distance metric learning | Distance Metric Learning, Similarity Learning, DML, Representation Learning via Distance |
| 相关≠ | 3 | 5 |
| 摘要≠ | Online Metric Learning adapts a Mahalanobis distance metric incrementally as new labeled examples or pairwise constraints arrive one at a time, without storing the full dataset. It merges the efficiency of online learning with the representational power of metric learning, making it suitable for streaming, large-scale, or continually changing environments where retraining from scratch is impractical. | Metric learning is a machine-learning framework that trains a distance or similarity function from data so that semantically similar examples end up close together in the learned space while dissimilar examples are pushed apart. Unlike fixed distances such as Euclidean, the learned metric adapts to the structure of the task, making downstream classifiers, clusterers, and retrieval systems significantly more accurate. |
| ScholarGate数据集 ↗ |
|
|