Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Multinomial logistisk regression× | Random Forest× | |
|---|---|---|
| Ämnesområde≠ | Statistik | Maskininlärning |
| Familj≠ | Regression model | Machine learning |
| Ursprungsår≠ | 1966–1974 | 2001 |
| Upphovsperson≠ | Cox (1966); Theil (1969); formalized by McFadden (1974) | Breiman, L. |
| Typ≠ | Generalized linear model | Ensemble (bagging of decision trees) |
| Ursprungskälla≠ | Agresti, A. (2002). Categorical Data Analysis (2nd ed.). Wiley-Interscience. ISBN: 978-0471360933 | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Alias | polytomous logistic regression, softmax regression, multinomial logit, nominal logistic regression | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Närliggande | 4 | 4 |
| Sammanfattning≠ | Multinomial logistic regression extends binary logistic regression to outcomes with three or more unordered categories. It models the log-odds of each category relative to a chosen reference category as a linear function of the predictors, and estimates all parameters simultaneously via maximum likelihood. It is the standard choice when the dependent variable is nominal with multiple levels. | 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. |
| ScholarGateDatamängd ↗ |
|
|