方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 多元逻辑回归× | 随机森林× | |
|---|---|---|
| 领域≠ | 统计学 | 机器学习 |
| 方法族≠ | Regression model | Machine learning |
| 起源年份≠ | 1966–1974 | 2001 |
| 提出者≠ | Cox (1966); Theil (1969); formalized by McFadden (1974) | Breiman, L. |
| 类型≠ | Generalized linear model | Ensemble (bagging of decision trees) |
| 开创性文献≠ | Agresti, A. (2002). Categorical Data Analysis (2nd ed.). Wiley-Interscience. ISBN: 978-0471360933 | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名 | polytomous logistic regression, softmax regression, multinomial logit, nominal logistic regression | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关 | 4 | 4 |
| 摘要≠ | 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. |
| ScholarGate数据集 ↗ |
|
|