Porovnať metódy

	Perceptron s viacerými vrstvami (MLP)	Logistická regresia	Náhodný les
Odbor	Strojové učenie	Štatistika vo výskume	Strojové učenie
Rodina	Machine learning	Process / pipeline	Machine learning
Rok vzniku	1986	1958	2001
Tvorca	Rumelhart, D. E., Hinton, G. E., & Williams, R. J.	David Roxbee Cox	Breiman, L.
Typ	Feedforward neural network (supervised learning)	Method	Ensemble (bagging of decision trees)
Pôvodný zdroj	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.
Ďalšie názvy	MLP, feedforward neural network, fully connected neural network, artificial neural network	logit model, binomial logistic regression, LR	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Príbuzné	4	3	4
Zhrnutie	The Multi-layer Perceptron (MLP) is a feedforward neural network architecture trained by backpropagation, formalised by Rumelhart, Hinton, and Williams in their landmark 1986 Nature paper. Composed of an input layer, one or more hidden layers of neurons with nonlinear activation functions, and an output layer, the MLP can approximate any continuous function to arbitrary accuracy and serves as the conceptual bridge between classical machine learning and 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.