방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 메트릭 학습× | 온라인 학습× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2003 (foundational); refined 2009 (LMNN) | 1958–2000s |
| 창시자≠ | Xing, E. P.; Jordan, M. I.; Russell, S.; Ng, A. Y. | Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors) |
| 유형≠ | Representation learning / supervised distance optimization | Learning paradigm (sequential model update) |
| 원전≠ | 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 ↗ | Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗ |
| 별칭 | Distance Metric Learning, Similarity Learning, DML, Representation Learning via Distance | incremental learning, sequential learning, streaming learning, online machine learning |
| 관련≠ | 5 | 6 |
| 요약≠ | 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. | Online learning is a machine learning paradigm in which a model is updated incrementally as each new data point arrives, rather than being trained once on a fixed dataset. It is essential when data streams continuously, storage is limited, or the underlying distribution shifts over time. Theoretical performance is measured by cumulative regret relative to the best fixed predictor in hindsight. |
| ScholarGate데이터셋 ↗ |
|
|