方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 长短期记忆网络× | 随机森林× | |
|---|---|---|
| 领域≠ | 深度学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1997 | 2001 |
| 提出者≠ | Hochreiter, S. & Schmidhuber, J. | Breiman, L. |
| 类型≠ | Recurrent neural network (gated memory cell) | Ensemble (bagging of decision trees) |
| 开创性文献≠ | Hochreiter, S. & Schmidhuber, J. (1997). Long Short-Term Memory. Neural Computation, 9(8), 1735–1780. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名 | LSTM (Uzun Kısa Dönem Bellek Ağı), long short-term memory, LSTM network, recurrent neural network with memory cells | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关≠ | 5 | 4 |
| 摘要≠ | LSTM (Long Short-Term Memory) is a recurrent neural network architecture, introduced by Sepp Hochreiter and Jürgen Schmidhuber in 1997, that can learn long-term dependencies in sequential data and is widely used for time-series and sequence prediction. It keeps an internal memory that lets information persist across many time steps. | 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数据集 ↗ |
|
|