विधियों की तुलना करें

	ऑनलाइन रैंडम फ़ॉरेस्ट	अर्ध-पर्यवेक्षित रैंडम फ़ॉरेस्ट
क्षेत्र	मशीन अधिगम	मशीन अधिगम
परिवार	Machine learning	Machine learning
उद्भव वर्ष	2009	2009
प्रवर्तक	Saffari, A. et al.	Leistner, C., Saffari, A., Santner, J., & Bischof, H.
प्रकार	Incremental ensemble (streaming decision trees)	Semi-supervised ensemble classifier
मौलिक स्रोत	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.	Leistner, C., Saffari, A., Santner, J., & Bischof, H. (2009). Semi-supervised random forests. In Proceedings of the IEEE 12th International Conference on Computer Vision (ICCV), pp. 506–513. IEEE.
उपनाम	ORF, streaming random forest, incremental random forest, adaptive random forest	SSL-RF, semi-supervised forest, label-propagation random forest, self-training random forest
संबंधित	6	3
सारांश	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.	Semi-supervised Random Forest (SSL-RF) extends the classic Random Forest by exploiting both labeled and unlabeled training examples. When labeling data is expensive or time-consuming, SSL-RF assigns tentative pseudo-labels to unlabeled observations through the forest itself, then retrains on the enriched dataset, progressively improving accuracy without requiring additional human annotation.