手法を比較

	説明可能な決定木	決定木	ロジスティック回帰	ランダムフォレスト	XGBoost
分野	機械学習	機械学習	研究統計	機械学習	機械学習
系統	Machine learning	Machine learning	Process / pipeline	Machine learning	Machine learning
提唱年	1984 (CART); XAI framing formalized 2010s–2020s	1984	1958	2001	2016
提唱者	Breiman, L.; Friedman, J.; Olshen, R. A.; Stone, C. J.	Breiman, Friedman, Olshen & Stone	David Roxbee Cox	Breiman, L.	Chen, T. & Guestrin, C.
種類	Interpretable supervised learning model	Recursive partitioning (if-then rules)	Method	Ensemble (bagging of decision trees)	Ensemble (gradient-boosted 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., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
別名	XDT, interpretable decision tree, rule-based decision tree, transparent decision tree	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	logit model, binomial logistic regression, LR	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	XGBoost, extreme gradient boosting, scalable tree boosting
関連	4	5	3	4	5
概要	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.	Logistic regression is a statistical method for modeling the probability of a binary outcome (disease present/absent, success/failure) as a function of continuous and categorical predictors. Developed by David Roxbee Cox (1958), it solves the problem of predicting categorical outcomes by applying a logistic transformation to constrain predictions to the [0,1] probability interval, enabling accurate risk stratification, diagnostic prediction, and causal inference in epidemiology, medicine, and social science.	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.	XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.