Compară metode

	AdaBoost	Arbore de decizie	Regresia Logistică	Stacking
Domeniu	Învățare automată	Învățare automată	Statistică pentru cercetare	Învățare automată
Familie	Machine learning	Machine learning	Process / pipeline	Machine learning
Anul apariției	1997	1984	1958	1992
Autorul original	Freund, Y. & Schapire, R.E.	Breiman, Friedman, Olshen & Stone	David Roxbee Cox	Wolpert, D.H.
Tip	Ensemble (sequential boosting of weak learners)	Recursive partitioning (if-then rules)	Method	Ensemble (heterogeneous meta-learning)
Sursa seminală	Freund, Y. & Schapire, R.E. (1997). A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. Journal of Computer and System Sciences, 55(1), 119–139.	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.	Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259.
Denumiri alternative	AdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırma	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	logit model, binomial logistic regression, LR	Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner
Înrudite	5	5	3	5
Rezumat	AdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification.	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.	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.