방법 비교

	로지스틱 회귀	랜덤 포레스트	순환 신경망
분야	연구 통계	머신러닝	딥러닝
계열	Process / pipeline	Machine learning	Machine learning
기원 연도	1958	2001	1986–1990
창시자	David Roxbee Cox	Breiman, L.	Rumelhart, D. E.; Elman, J. L.
유형	Method	Ensemble (bagging of decision trees)	Sequential neural network
원전	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.	Elman, J. L. (1990). Finding structure in time. Cognitive Science, 14(2), 179–211.
별칭	logit model, binomial logistic regression, LR	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	RNN, Elman network, Jordan network, simple recurrent network
관련	3	4	3
요약	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.	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.