Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Stacking× | Drzewo decyzyjne× | Maszyna wektorów nośnych (klasyfikacja)× | |
|---|---|---|---|
| Dziedzina | Uczenie maszynowe | Uczenie maszynowe | Uczenie maszynowe |
| Rodzina | Machine learning | Machine learning | Machine learning |
| Rok powstania≠ | 1992 | 1984 | 1995 |
| Twórca≠ | Wolpert, D.H. | Breiman, Friedman, Olshen & Stone | Cortes, C. & Vapnik, V. |
| Typ≠ | Ensemble (heterogeneous meta-learning) | Recursive partitioning (if-then rules) | Maximum-margin classifier (kernel method) |
| Źródło pierwotne≠ | 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 ↗ | Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗ |
| Inne nazwy≠ | Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier |
| Pokrewne | 5 | 5 | 5 |
| Podsumowanie≠ | 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. | The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data. |
| ScholarGateZbiór danych ↗ |
|
|
|