手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| スタッキング× | 決定木× | |
|---|---|---|
| 分野 | 機械学習 | 機械学習 |
| 系統 | Machine learning | Machine learning |
| 提唱年≠ | 1992 | 1984 |
| 提唱者≠ | Wolpert, D.H. | Breiman, Friedman, Olshen & Stone |
| 種類≠ | Ensemble (heterogeneous meta-learning) | Recursive partitioning (if-then rules) |
| 原典≠ | Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ |
| 別名 | Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree |
| 関連 | 5 | 5 |
| 概要≠ | Stacking, or stacked generalization, is an ensemble method introduced by David Wolpert in 1992 that combines the outputs of several different base models (Level-0) through a separate meta-model (Level-1). Unlike bagging and boosting, it deliberately uses heterogeneous model types, and it is the standard final-stage strategy in Kaggle competitions. | 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データセット ↗ |
|
|