방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이즈 측도 학습× | 메트릭 학습× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2010s | 2003 (foundational); refined 2009 (LMNN) |
| 창시자≠ | Multiple (Xing et al. 2002; Weinberger & Saul 2009; probabilistic extensions by various authors ~2010s) | Xing, E. P.; Jordan, M. I.; Russell, S.; Ng, A. Y. |
| 유형≠ | Probabilistic distance metric learning | Representation learning / supervised distance optimization |
| 원전≠ | Weinberger, K. Q., & Saul, L. K. (2009). Distance metric learning for large margin nearest neighbor classification. Journal of Machine Learning Research, 10, 207–244. 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 ↗ |
| 별칭 | BML, probabilistic metric learning, Bayesian distance metric learning, Bayesian similarity learning | Distance Metric Learning, Similarity Learning, DML, Representation Learning via Distance |
| 관련 | 5 | 5 |
| 요약≠ | Bayesian Metric Learning frames the problem of learning a task-adapted distance function as probabilistic inference. Rather than producing a single optimal metric matrix, it places a prior over metrics, updates it with pairwise similarity or label constraints, and yields a posterior distribution that quantifies uncertainty about which metric best captures the true structure of the data. | 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데이터셋 ↗ |
|
|