ScholarGate
Βοηθός

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

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

Διαδικτυακή Μάθηση Συνόλων×Ενίσχυση×
ΠεδίοΜηχανική ΜάθησηΜηχανική Μάθηση
ΟικογένειαMachine learningMachine learning
Έτος προέλευσης20011990–1997
ΔημιουργόςOza, N. C. & Russell, S.Schapire, R. E.; Freund, Y.
ΤύποςEnsemble (online / incremental)Sequential ensemble (iterative reweighting)
Θεμελιώδης πηγήOza, N. C., & Russell, S. (2001). Online bagging and boosting. In Proceedings of the Eighth International Workshop on Artificial Intelligence and Statistics (AISTATS 2001), pp. 229–236. link ↗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 ↗
Εναλλακτικές ονομασίεςonline ensemble methods, streaming ensemble learning, incremental ensemble learning, adaptive ensemble learningAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
Συναφείς66
ΣύνοψηEnsemble Online Learning combines multiple base learners that are trained incrementally on a stream of data, updating each model one observation at a time. By aggregating the predictions of diverse online learners, the ensemble achieves accuracy and robustness that surpass any single incremental model, while adapting continuously to changing data distributions.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.
ScholarGateΣύνολο δεδομένων
  1. v1
  2. 2 Πηγές
  3. PUBLISHED
  1. v1
  2. 2 Πηγές
  3. PUBLISHED

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

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