ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

الغابة العشوائية المتصلة بالإنترنت×التعلم عبر الإنترنت×
المجالتعلم الآلةتعلم الآلة
العائلةMachine learningMachine learning
سنة النشأة20091958–2000s
صاحب الطريقةSaffari, A. et al.Rosenblatt, F.; Littlestone, N.; Shalev-Shwartz, S. (key contributors)
النوعIncremental ensemble (streaming decision trees)Learning paradigm (sequential model update)
المصدر التأسيسيSaffari, A., Leistner, C., Santner, J., Godec, M., & Bischof, H. (2009). On-line random forests. In Proceedings of the 3rd IEEE International Workshop on On-Line Learning for Computer Vision (OLCV 2009), pp. 1–8. IEEE. link ↗Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194. DOI ↗
الأسماء البديلةORF, streaming random forest, incremental random forest, adaptive random forestincremental learning, sequential learning, streaming learning, online machine learning
ذات صلة66
الملخصOnline Random Forest (ORF) extends the classic Random Forest to streaming settings, updating each tree incrementally as new observations arrive without storing or replaying the full training set. Algorithms such as Adaptive Random Forests (ARF) add drift detection so the ensemble adapts when the data distribution changes over time.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قارن الطرق: Online Random Forest · Online Learning. استُرجع بتاريخ 2026-06-17 من https://scholargate.app/ar/compare