Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| CatBoost× | Δέντρο Αποφάσεων× | Λογιστική Παλινδρόμηση× | |
|---|---|---|---|
| Πεδίο≠ | Μηχανική Μάθηση | Μηχανική Μάθηση | Ερευνητική Στατιστική |
| Οικογένεια≠ | Machine learning | Machine learning | Process / pipeline |
| Έτος προέλευσης≠ | 2018 | 1984 | 1958 |
| Δημιουργός≠ | Prokhorenkova, L. et al. (Yandex) | Breiman, Friedman, Olshen & Stone | David Roxbee Cox |
| Τύπος≠ | Gradient boosting on decision trees | Recursive partitioning (if-then rules) | Method |
| Θεμελιώδης πηγή≠ | Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A.V. & Gulin, A. (2018). CatBoost: Unbiased Boosting with Categorical Features. In NeurIPS 2018. DOI ↗ | 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 ↗ |
| Εναλλακτικές ονομασίες≠ | CatBoost (Categorical Boosting), categorical boosting, ordered boosting, kategorik gradyan artırma | Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree | logit model, binomial logistic regression, LR |
| Συναφείς≠ | 5 | 5 | 3 |
| Σύνοψη≠ | CatBoost is a gradient boosting algorithm, introduced by Prokhorenkova and colleagues at Yandex in 2018, that handles categorical variables natively and uses ordered target encoding to avoid label leakage. By building an additive ensemble of trees while permuting the data order at each iteration, it is often superior to XGBoost and LightGBM on category-heavy data. | 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Σύνολο δεδομένων ↗ |
|
|
|