手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| ロジスティック回帰 (ML)× | 決定木× | |
|---|---|---|
| 分野 | 機械学習 | 機械学習 |
| 系統 | Machine learning | Machine learning |
| 提唱年≠ | 1958 | 1984 |
| 提唱者≠ | Cox, D. R. | Breiman, Friedman, Olshen & Stone |
| 種類≠ | Probabilistic linear classifier | Recursive partitioning (if-then rules) |
| 原典≠ | Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ |
| 別名≠ | logit model, logit regression, binomial logistic regression, maximum entropy classifier | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree |
| 関連 | 5 | 5 |
| 概要≠ | Logistic regression is a foundational probabilistic classifier that models the log-odds of a binary (or multinomial) outcome as a linear function of the predictors. Introduced by D. R. Cox in 1958, it remains one of the most widely used and interpretable classification methods in both statistics and machine learning, valued for its calibrated probability outputs and clear coefficient interpretation. | 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. |
| ScholarGateデータセット ↗ |
|
|