ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

준지도 학습 거리 학습×메트릭 학습×
분야머신러닝머신러닝
계열Machine learningMachine learning
기원 연도2007–20082003 (foundational); refined 2009 (LMNN)
창시자Yeung, D.-Y. & Chang, H.; Davis, J. V. & Dhillon, I. S.Xing, E. P.; Jordan, M. I.; Russell, S.; Ng, A. Y.
유형Hybrid supervised/unsupervised distance learningRepresentation learning / supervised distance optimization
원전Yeung, D.-Y., & Chang, H. (2007). A kernel approach for semi-supervised metric learning. IEEE Transactions on Neural Networks, 18(1), 141–149. DOI ↗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 ↗
별칭SSML, semi-supervised distance learning, constrained metric learning, weakly supervised metric learningDistance Metric Learning, Similarity Learning, DML, Representation Learning via Distance
관련55
요약Semi-supervised metric learning learns a task-adapted distance function by combining a small set of labeled pairwise constraints — must-link and cannot-link pairs — with the geometric structure of a much larger pool of unlabeled data. The result is a Mahalanobis-style or kernel-based distance that reflects both supervision and data topology, improving downstream tasks such as nearest-neighbor classification and clustering.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데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Semi-supervised Metric Learning · Metric Learning. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare