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

	ব্যাখ্যাযোগ্য সাপোর্ট ভেক্টর মেশিন	ব্যাখ্যাযোগ্য র‍্যান্ডম ফরেস্ট
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2016–2017 (XAI layer)	2001–2017
প্রবর্তক	Cortes & Vapnik (SVM); explainability layer via Lundberg & Lee (SHAP, 2017) and Ribeiro et al. (LIME, 2016)	Breiman, L. (RF); Lundberg & Lee (SHAP attribution)
ধরন	Post-hoc explainability applied to SVM	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.
অপর নাম	Explainable SVM, Interpretable SVM, XAI-SVM, Transparent Support Vector Machine	XRF, interpretable random forest, transparent random forest, random forest with explainability
সম্পর্কিত	4	4
সারসংক্ষেপ	Explainable SVM combines a trained Support Vector Machine with a post-hoc interpretability layer — typically SHAP or LIME — to produce feature-level explanations for individual predictions and global importance rankings. It retains the discriminative power of SVM while meeting transparency requirements in high-stakes domains such as medicine, finance, and law.	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.