Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Régression logistique (ML)× | Arbre de décision× | |
|---|---|---|
| Domaine | Apprentissage automatique | Apprentissage automatique |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 1958 | 1984 |
| Auteur d'origine≠ | Cox, D. R. | Breiman, Friedman, Olshen & Stone |
| Type≠ | Probabilistic linear classifier | Recursive partitioning (if-then rules) |
| Source fondatrice≠ | Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗ | Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗ |
| Alias≠ | logit model, logit regression, binomial logistic regression, maximum entropy classifier | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree |
| Apparentées | 5 | 5 |
| Résumé≠ | Logistic regression is a foundational probabilistic classifier that models the log-odds of a binary (or multinomial) outcome as a linear function of the predictors. Introduced by D. R. Cox in 1958, it remains one of the most widely used and interpretable classification methods in both statistics and machine learning, valued for its calibrated probability outputs and clear coefficient interpretation. | 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. |
| ScholarGateJeu de données ↗ |
|
|