ScholarGate
Asistents

Salīdzināt metodes

Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.

AdaBoost×Iezīmju izplatīšana×
NozareMašīnmācīšanāsMašīnmācīšanās
SaimeMachine learningMachine learning
Izcelsmes gads19972002
AutorsFreund, Y. & Schapire, R.E.Zhu, X. & Ghahramani, Z.
TipsEnsemble (sequential boosting of weak learners)Graph-based semi-supervised classification
PirmavotsFreund, 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 ↗
Citi nosaukumiAdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırmaLP, label spreading, graph-based semi-supervised learning, harmonic label propagation
Saistītās53
KopsavilkumsAdaBoost (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.
ScholarGateDatu kopa
  1. v1
  2. 1 Avoti
  3. PUBLISHED
  1. v1
  2. 3 Avoti
  3. PUBLISHED

Doties uz meklēšanu Lejupielādēt slaidus

ScholarGateSalīdzināt metodes: AdaBoost · Label Propagation. Izgūts 2026-06-18 no https://scholargate.app/lv/compare