השוואת שיטות

	Isolation Forest חצי-מפוקח	יער אקראי
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	2013–2020	2001
הוגה השיטה	Extended from Liu, F.T., Ting, K.M., and Zhou, Z-H. (iForest, 2008); semi-supervised variants developed by multiple authors ca. 2013–2020	Breiman, L.
סוג	Ensemble anomaly detection (semi-supervised extension)	Ensemble (bagging of decision trees)
מקור מכונן	Görnitz, N., Kloft, M., Rieck, K., & Brefeld, U. (2013). Toward supervised anomaly detection. Journal of Artificial Intelligence Research, 46, 235–262.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
כינויים	SSIF, semi-supervised iForest, label-guided Isolation Forest, partially supervised Isolation Forest	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
קשורות	6	4
תקציר	Semi-supervised Isolation Forest extends the classic Isolation Forest anomaly detector by incorporating a small set of labeled anomaly (and possibly normal) examples alongside a large unlabeled dataset. This label guidance adjusts the model's anomaly scores so that known anomalies are separated more reliably, bridging the gap between fully unsupervised and fully supervised detection.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.