Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Дерево рішень× | Логістична регресія× | |
|---|---|---|
| Галузь≠ | Машинне навчання | Статистика досліджень |
| Родина≠ | 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Набір даних ↗ |
|
|