ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

למידה פעילה×אלגוריתם התפשטות התוויות (Label Propagation)×למידה מונחית-למחצה×
תחוםלמידת מכונהלמידת מכונהלמידת מכונה
משפחהMachine learningMachine learningMachine learning
שנת המקור200920021970s–2006 (formalized)
הוגה השיטהBurr SettlesZhu, X. & Ghahramani, Z.Vapnik, V. N. and others (community of researchers, 1970s–2000s)
סוגInteractive supervised learning frameworkGraph-based semi-supervised classificationLearning paradigm
מקור מכונןSettles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. 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 ↗Chapelle, O., Scholkopf, B., & Zien, A. (Eds.) (2006). Semi-Supervised Learning. MIT Press. ISBN: 978-0-262-03358-9
כינוייםQuery Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif ÖğrenmeLP, label spreading, graph-based semi-supervised learning, harmonic label propagationSSL, semi-supervised machine learning, transductive learning, label-efficient learning
קשורות235
תקצירActive learning is an iterative machine-learning paradigm in which a learning algorithm selectively queries an oracle — typically a human annotator — for labels on the most informative unlabeled examples. Formalized by Burr Settles in his seminal 2009 literature survey, active learning addresses the practical bottleneck of annotation cost by achieving high model accuracy with far fewer labeled examples than passive supervised learning requires.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.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מערך נתונים
  1. v1
  2. 1 מקורות
  3. PUBLISHED
  1. v1
  2. 3 מקורות
  3. PUBLISHED
  1. v1
  2. 2 מקורות
  3. PUBLISHED

מעבר לחיפוש הורדת מצגת

ScholarGateהשוואת שיטות: Active Learning · Label Propagation · Semi-supervised Learning. אוחזר בתאריך 2026-06-17 מתוך https://scholargate.app/he/compare