ScholarGate
Βοηθός

Σύγκριση μεθόδων

Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.

Ενίσχυση×Διαδικτυακή Μάθηση×
ΠεδίοΜηχανική ΜάθησηΜηχανική Μάθηση
ΟικογένειαMachine learningMachine learning
Έτος προέλευσης1990–19971958–2000s
ΔημιουργόςSchapire, R. E.; Freund, Y.Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)
ΤύποςSequential ensemble (iterative reweighting)Learning paradigm (sequential model update)
Θεμελιώδης πηγή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 ↗Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗
Εναλλακτικές ονομασίεςAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleincremental learning, sequential learning, streaming learning, online machine learning
Συναφείς66
ΣύνοψηBoosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.Online learning is a machine learning paradigm in which a model is updated incrementally as each new data point arrives, rather than being trained once on a fixed dataset. It is essential when data streams continuously, storage is limited, or the underlying distribution shifts over time. Theoretical performance is measured by cumulative regret relative to the best fixed predictor in hindsight.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 2 Πηγές
  3. PUBLISHED

Μετάβαση στην αναζήτηση Λήψη διαφανειών

ScholarGateΣύγκριση μεθόδων: Boosting · Online Learning. Ανακτήθηκε στις 2026-06-18 από https://scholargate.app/el/compare