Vertaile menetelmiä

	Logistinen regressio	Rekurrentti neuroverkko	XGBoost
Tieteenala	Tutkimuksen tilastomenetelmät	Syväoppiminen	Koneoppiminen
Menetelmäperhe	Process / pipeline	Machine learning	Machine learning
Syntyvuosi	1958	1986–1990	2016
Kehittäjä	David Roxbee Cox	Rumelhart, D. E.; Elman, J. L.	Chen, T. & Guestrin, C.
Tyyppi	Method	Sequential neural network	Ensemble (gradient-boosted decision trees)
Alkuperäislähde	Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242.	Elman, J. L. (1990). Finding structure in time. Cognitive Science, 14(2), 179–211.	Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794.
Rinnakkaisnimet	logit model, binomial logistic regression, LR	RNN, Elman network, Jordan network, simple recurrent network	XGBoost, extreme gradient boosting, scalable tree boosting
Liittyvät	3	3	5
Tiivistelmä	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.	A Recurrent Neural Network (RNN) is a class of neural network designed to process sequential data by maintaining a hidden state that carries information across time steps. Introduced in its modern form by Rumelhart et al. (1986) and further shaped by Elman (1990), RNNs became the dominant architecture for sequence modelling in NLP, speech, and time-series analysis before the rise of attention-based models.	XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions.