השוואת שיטות

	אנסמבל הצבעה מוסבר	יער אקראי מוסבר (Explainable Random Forest - XRF)
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	2016–2020	2001–2017
הוגה השיטה	Composite: voting ensemble (Dietterich, 2000) + XAI frameworks (Ribeiro et al., 2016; Lundberg & Lee, 2017)	Breiman, L. (RF); Lundberg & Lee (SHAP attribution)
סוג	Ensemble with post-hoc or ante-hoc interpretability	Interpretable ensemble (bagging + post-hoc attribution)
מקור מכונן	Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774.	Lundberg, S. M., & Lee, S.-I. (2017). A unified approach to interpreting model predictions. Advances in Neural Information Processing Systems, 30, 4765–4774.
כינויים	XAI voting ensemble, interpretable voting classifier, transparent voting ensemble, explainable majority vote model	XRF, interpretable random forest, transparent random forest, random forest with explainability
קשורות	6	4
תקציר	An Explainable Voting Ensemble combines predictions from multiple diverse base models through majority vote (hard voting) or averaged probabilities (soft voting), then applies post-hoc or ante-hoc XAI techniques — such as SHAP values, LIME, or permutation importance — to produce feature-level explanations for the combined model's decisions. The goal is to retain the accuracy gains of ensemble aggregation while meeting interpretability requirements in high-stakes or regulated applications.	Explainable Random Forest (XRF) combines the predictive power of Breiman's Random Forest ensemble with systematic post-hoc attribution methods — principally SHAP values and mean-decrease-in-impurity importance — to make model decisions transparent and auditable. It delivers both high accuracy and human-interpretable feature contributions, satisfying demands from regulators, domain experts, and academic reviewers alike.