ScholarGate
עוזר

השוואת שיטות

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

חיזוק חצי-מפוקח×AdaBoost×אלגוריתם התפשטות התוויות (Label Propagation)×
תחוםלמידת מכונהלמידת מכונהלמידת מכונה
משפחהMachine learningMachine learningMachine learning
שנת המקור1999–200919972002
הוגה השיטהMallapragada, P. K.; Bennett, K. P.; and othersFreund, Y. & Schapire, R.E.Zhu, X. & Ghahramani, Z.
סוגSemi-supervised ensemble methodEnsemble (sequential boosting of weak learners)Graph-based semi-supervised classification
מקור מכונןMallapragada, P. K., Jin, R., Jain, A. K., & Liu, Y. (2009). SemiBoost: Boosting for Semi-supervised Learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(11), 2000–2014. DOI ↗Freund, Y. & Schapire, R.E. (1997). A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. link ↗
כינוייםSemiBoost, SSL boosting, boosting with unlabeled data, semi-supervised ensemble boostingAdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırmaLP, label spreading, graph-based semi-supervised learning, harmonic label propagation
קשורות553
תקצירSemi-supervised Boosting is an ensemble learning paradigm that extends classical boosting algorithms — such as AdaBoost — to exploit both labeled and unlabeled data. By propagating label information through a similarity structure over unlabeled instances, it trains stronger classifiers than supervised boosting alone when labeled data are scarce.AdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification.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. 1 מקורות
  3. PUBLISHED
  1. v1
  2. 3 מקורות
  3. PUBLISHED

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

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