방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 결정 트리× | 로지스틱 회귀× | |
|---|---|---|
| 분야≠ | 머신러닝 | 연구 통계 |
| 계열≠ | Machine learning | Process / pipeline |
| 기원 연도≠ | 1984 | 1958 |
| 창시자≠ | Breiman, Friedman, Olshen & Stone | David Roxbee Cox |
| 유형≠ | Recursive partitioning (if-then rules) | Method |
| 원전≠ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ | Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗ |
| 별칭≠ | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | logit model, binomial logistic regression, LR |
| 관련≠ | 5 | 3 |
| 요약≠ | A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf. | 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데이터셋 ↗ |
|
|