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

	ব্যাখ্যাযোগ্য ডিসিশন ট্রি (Explainable Decision Tree)	Random Forest
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1984 (CART); XAI framing formalized 2010s–2020s	2001
প্রবর্তক	Breiman, L.; Friedman, J.; Olshen, R. A.; Stone, C. J.	Breiman, L.
ধরন	Interpretable supervised learning model	Ensemble (bagging of decision trees)
মৌলিক উৎস	Breiman, L., Friedman, J., Olshen, R. A., & Stone, C. J. (1984). Classification and Regression Trees. Wadsworth & Brooks/Cole. ISBN: 978-0-412-04841-8	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
অপর নাম	XDT, interpretable decision tree, rule-based decision tree, transparent decision tree	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
সম্পর্কিত	4	4
সারসংক্ষেপ	An Explainable Decision Tree is a classification or regression tree deliberately grown to be shallow, readable, and auditable — producing a finite set of if-then rules that a human can verify without additional tools. It sits at the intersection of predictive modelling and Explainable AI (XAI), chosen when stakeholders must understand and trust every prediction the model makes.	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.