Sammenlign metoder
Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.
| Neural ODE× | LSTM× | Random Forest× | |
|---|---|---|---|
| Fagområde≠ | Dyb læring | Dyb læring | Maskinlæring |
| Familie | Machine learning | Machine learning | Machine learning |
| Oprindelsesår≠ | 2018 | 1997 | 2001 |
| Ophavsperson≠ | Chen, T. Q. et al. | Hochreiter, S. & Schmidhuber, J. | Breiman, L. |
| Type≠ | Continuous-depth neural network (ODE-parameterised dynamics) | Recurrent neural network (gated memory cell) | Ensemble (bagging of decision trees) |
| Oprindelig kilde≠ | Chen, T. Q., Rubanova, Y., Bettencourt, J. & Duvenaud, D. (2018). Neural Ordinary Differential Equations. Advances in Neural Information Processing Systems (NeurIPS). link ↗ | 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 ↗ |
| Aliasser | Nöral Diferansiyel Denklem (Neural ODE), neural ordinary differential equation, continuous-depth network, ODE-Net | 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 |
| Relaterede≠ | 4 | 5 | 4 |
| Resumé≠ | A Neural ODE, introduced by Chen and colleagues in 2018, models a hidden state as the continuous solution of an ordinary differential equation whose dynamics are parameterised by a neural network. It generalises the limiting case of residual connections, making it well suited to irregularly spaced time series and physics-based modelling. | 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. |
| ScholarGateDatasæt ↗ |
|
|
|