방법 비교

	온라인 랜덤 포레스트	온라인 학습
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2009	1958–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.	Shalev-Shwartz, S. (2011). Online Learning and Online Convex Optimization. Foundations and Trends in Machine Learning, 4(2), 107–194.
별칭	ORF, streaming random forest, incremental random forest, adaptive random forest	incremental learning, sequential learning, streaming learning, online machine learning
관련	6	6
요약	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.