ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

自监督 K-近邻×半监督K近邻×
领域机器学习机器学习
方法族Machine learningMachine learning
起源年份2018–20202002 (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 classifierSemi-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 classifierSS-KNN, semi-supervised KNN, KNN label propagation, graph-based semi-supervised KNN
相关44
摘要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数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Self-supervised K-nearest neighbors · Semi-supervised K-nearest neighbors. 于 2026-06-19 检索自 https://scholargate.app/zh/compare