방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 랜덤 포레스트× | 로지스틱 회귀× | |
|---|---|---|
| 분야≠ | 머신러닝 | 연구 통계 |
| 계열≠ | Machine learning | Process / pipeline |
| 기원 연도≠ | 2001 | 1958 |
| 창시자≠ | Breiman, L. | David Roxbee Cox |
| 유형≠ | Ensemble (bagging of decision trees) | Method |
| 원전≠ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ | Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗ |
| 별칭≠ | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble | logit model, binomial logistic regression, LR |
| 관련≠ | 4 | 3 |
| 요약≠ | 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. | 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. |
| ScholarGate데이터셋 ↗ |
|
|