방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 준지도 K-최근접 이웃 (Semi-supervised K-Nearest Neighbors)× | 준지도 학습× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2002 (semi-supervised extension); 1967 (KNN base) | 1970s–2006 (formalized) |
| 창시자≠ | Zhu, X. & Ghahramani, Z. (label propagation); Cover, T. & Hart, P. (KNN base) | Vapnik, V. N. and others (community of researchers, 1970s–2000s) |
| 유형≠ | Semi-supervised classifier / label propagation | Learning paradigm |
| 원전≠ | Zhu, X. & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. link ↗ | Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9 |
| 별칭 | SS-KNN, semi-supervised KNN, KNN label propagation, graph-based semi-supervised KNN | SSL, semi-supervised machine learning, transductive learning, label-efficient learning |
| 관련≠ | 4 | 5 |
| 요약≠ | 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. | Semi-supervised learning (SSL) is a machine learning paradigm that trains models using a small set of labeled examples together with a much larger pool of unlabeled data. By leveraging the structure inherent in unlabeled data, SSL achieves accuracy closer to fully supervised models while requiring far fewer costly manual labels — making it practical when labeling is expensive, slow, or resource-constrained. |
| ScholarGate데이터셋 ↗ |
|
|