Methoden vergelijken
Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.
| LSTM× | Recurrent Neuraal Netwerk× | XGBoost× | |
|---|---|---|---|
| Vakgebied≠ | Deep learning | Deep learning | Machine learning |
| Familie | Machine learning | Machine learning | Machine learning |
| Jaar van ontstaan≠ | 1997 | 1986–1990 | 2016 |
| Grondlegger≠ | Hochreiter, S. & Schmidhuber, J. | Rumelhart, D. E.; Elman, J. L. | Chen, T. & Guestrin, C. |
| Type≠ | Recurrent neural network (gated memory cell) | Sequential neural network | Ensemble (gradient-boosted decision trees) |
| Oorspronkelijke bron≠ | Hochreiter, S. & Schmidhuber, J. (1997). Long Short-Term Memory. Neural Computation, 9(8), 1735–1780. DOI ↗ | Elman, J. L. (1990). Finding structure in time. Cognitive Science, 14(2), 179–211. DOI ↗ | Chen, T. & Guestrin, C. (2016). XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD, 785–794. DOI ↗ |
| Aliassen≠ | LSTM (Uzun Kısa Dönem Bellek Ağı), long short-term memory, LSTM network, recurrent neural network with memory cells | RNN, Elman network, Jordan network, simple recurrent network | XGBoost, extreme gradient boosting, scalable tree boosting |
| Verwant≠ | 5 | 3 | 5 |
| Samenvatting≠ | 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. | A Recurrent Neural Network (RNN) is a class of neural network designed to process sequential data by maintaining a hidden state that carries information across time steps. Introduced in its modern form by Rumelhart et al. (1986) and further shaped by Elman (1990), RNNs became the dominant architecture for sequence modelling in NLP, speech, and time-series analysis before the rise of attention-based models. | 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. |
| ScholarGateGegevensset ↗ |
|
|
|