ScholarGate
सहायक

विधियों की तुलना करें

चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।

अर्ध-पर्यवेक्षित K-निकटतम पड़ोसी (Semi-supervised K-Nearest Neighbors)×लेबल प्रोपेगेशन×
क्षेत्रमशीन अधिगममशीन अधिगम
परिवारMachine learningMachine learning
उद्भव वर्ष2002 (semi-supervised extension); 1967 (KNN base)2002
प्रवर्तकZhu, X. & Ghahramani, Z. (label propagation); Cover, T. & Hart, P. (KNN base)Zhu, X. & Ghahramani, Z.
प्रकारSemi-supervised classifier / label propagationGraph-based semi-supervised classification
मौलिक स्रोतZhu, X. & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. 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 ↗
उपनामSS-KNN, semi-supervised KNN, KNN label propagation, graph-based semi-supervised KNNLP, label spreading, graph-based semi-supervised learning, harmonic label propagation
संबंधित43
सारांश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.Label Propagation is a graph-based semi-supervised learning algorithm introduced by Zhu and Ghahramani in 2002 that spreads class labels from a small set of labeled nodes to a large set of unlabeled nodes by iteratively diffusing label information along the edges of a similarity graph, exploiting the manifold structure of the data.
ScholarGateडेटासेट
  1. v1
  2. 2 स्रोत
  3. PUBLISHED
  1. v1
  2. 3 स्रोत
  3. PUBLISHED

खोज पर जाएँ स्लाइड डाउनलोड करें

ScholarGateविधियों की तुलना करें: Semi-supervised K-nearest neighbors · Label Propagation. 2026-06-19 को यहाँ से प्राप्त https://scholargate.app/hi/compare