পদ্ধতির তুলনা করুন

	ব্যাখ্যাযোগ্য ভোটিং এনসেম্বল (Explainable Voting Ensemble)	ব্যাখ্যাযোগ্য র‍্যান্ডম ফরেস্ট
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	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.