방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 자기 지도식 K-최근접 이웃× | 준지도 K-최근접 이웃 (Semi-supervised K-Nearest Neighbors)× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2018–2020 | 2002 (semi-supervised extension); 1967 (KNN base) |
| 창시자≠ | Wu, Z. et al. / Chen, T. et al. | Zhu, X. & Ghahramani, Z. (label propagation); Cover, T. & Hart, P. (KNN base) |
| 유형≠ | Self-supervised + non-parametric classifier | Semi-supervised classifier / label propagation |
| 원전≠ | Chen, T., Kornblith, S., Norouzi, M., & Hinton, G. (2020). A simple framework for contrastive learning of visual representations. In Proceedings of the 37th International Conference on Machine Learning (ICML), PMLR 119, 1597–1607. link ↗ | Zhu, X. & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. link ↗ |
| 별칭 | SSL-kNN, self-supervised kNN classifier, kNN evaluation probe, nearest-neighbor self-supervised classifier | SS-KNN, semi-supervised KNN, KNN label propagation, graph-based semi-supervised KNN |
| 관련 | 4 | 4 |
| 요약≠ | Self-supervised K-nearest neighbors (SSL-kNN) combines representation learning without labels with a non-parametric k-NN classifier. A neural encoder is first trained via a self-supervised objective — such as contrastive or masked prediction — so that semantically similar samples cluster together in the embedding space. A simple k-NN lookup on those embeddings then assigns class labels, serving both as a lightweight probe and as a practical classifier. | Semi-supervised KNN extends the classic K-nearest neighbors algorithm to exploit large pools of unlabeled data alongside a small labeled set. By building a KNN graph over all observations and propagating known labels through the graph's edges, the method infers labels for unlabeled points without requiring expensive manual annotation of every sample. |
| ScholarGate데이터셋 ↗ |
|
|