Vertaile menetelmiä

	Monikerki-kerrosperceptron (MLP)	Logistinen regressio	Random Forest
Tieteenala	Syväoppiminen	Tutkimuksen tilastomenetelmät	Koneoppiminen
Menetelmäperhe	Machine learning	Process / pipeline	Machine learning
Syntyvuosi	1986	1958	2001
Kehittäjä	Rumelhart, D. E.; Hinton, G. E.; Williams, R. J.	David Roxbee Cox	Breiman, L.
Tyyppi	Supervised feedforward neural network	Method	Ensemble (bagging of decision trees)
Alkuperäislähde	Rumelhart, D. E., Hinton, G. E. & Williams, R. J. (1986). Learning representations by back-propagating errors. Nature, 323, 533–536.	Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Rinnakkaisnimet	MLP, feedforward neural network, fully connected neural network, vanilla neural network	logit model, binomial logistic regression, LR	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Liittyvät	4	3	4
Tiivistelmä	A Multilayer Perceptron is a classic fully connected feedforward neural network trained with the backpropagation algorithm, as formalised by Rumelhart, Hinton & Williams in their landmark 1986 Nature paper. Composed of an input layer, one or more hidden layers of neurons, and an output layer, the MLP learns nonlinear mappings from input features to target outputs and serves as the foundational building block of modern deep learning.	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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.