Sammenlign metoder
Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.
| Neural ODE× | LSTM× | XGBoost× | |
|---|---|---|---|
| Fagområde≠ | Dyb læring | Dyb læring | Maskinlæring |
| Familie | Machine learning | Machine learning | Machine learning |
| Oprindelsesår≠ | 2018 | 1997 | 2016 |
| Ophavsperson≠ | Chen, T. Q. et al. | Hochreiter, S. & Schmidhuber, J. | Chen, T. & Guestrin, C. |
| Type≠ | Continuous-depth neural network (ODE-parameterised dynamics) | Recurrent neural network (gated memory cell) | Ensemble (gradient-boosted 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 ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. 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 | XGBoost, extreme gradient boosting, scalable tree boosting |
| Relaterede≠ | 4 | 5 | 5 |
| 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. | XGBoost (Extreme Gradient Boosting) is a scalable tree-boosting algorithm introduced by Tianqi Chen and Carlos Guestrin in 2016. It builds a strong predictor by adding decision trees one at a time, each correcting the errors left by the trees before it, and is a powerful prediction method widely used in competitions. |
| ScholarGateDatasæt ↗ |
|
|
|