手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| 線形回帰（機械学習）× | 決定木× | |
|---|---|---|
| 分野 | 機械学習 | 機械学習 |
| 系統 | Machine learning | Machine learning |
| 提唱年≠ | 1805–1809 | 1984 |
| 提唱者≠ | Legendre, A.-M. & Gauss, C.F. | Breiman, Friedman, Olshen & Stone |
| 種類≠ | Supervised regression | Recursive partitioning (if-then rules) |
| 原典≠ | Hastie, T., Tibshirani, R. & Friedman, J. (2009). The Elements of Statistical Learning: Data Mining, Inference, and Prediction (2nd ed., Ch. 3). Springer. ISBN: 978-0-387-84858-7 | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ |
| 別名≠ | ordinary least squares regression, OLS, least squares regression, multiple linear regression | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree |
| 関連 | 5 | 5 |
| 概要≠ | Linear regression fits a straight-line relationship between one or more input features and a continuous numeric outcome by minimising the sum of squared prediction errors. As a machine-learning model it is trained on labeled examples and evaluated on held-out data, making it the simplest supervised learning baseline for any regression task. | 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データセット ↗ |
|
|