Compară metode

	Arbore de decizie explicabil	Arbore de decizie
Domeniu	Învățare automată	Învățare automată
Familie	Machine learning	Machine learning
Anul apariției	1984 (CART); XAI framing formalized 2010s–2020s	1984
Autorul original	Breiman, L.; Friedman, J.; Olshen, R. A.; Stone, C. J.	Breiman, Friedman, Olshen & Stone
Tip	Interpretable supervised learning model	Recursive partitioning (if-then rules)
Sursa seminală	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., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.
Denumiri alternative	XDT, interpretable decision tree, rule-based decision tree, transparent decision tree	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree
Înrudite	4	5
Rezumat	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.	A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.