Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| LSTM× | Forêt Aléatoire× | |
|---|---|---|
| Domaine≠ | Apprentissage profond | Apprentissage automatique |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 1997 | 2001 |
| Auteur d'origine≠ | Hochreiter, S. & Schmidhuber, J. | Breiman, L. |
| Type≠ | Recurrent neural network (gated memory cell) | Ensemble (bagging of decision trees) |
| Source fondatrice≠ | 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 ↗ |
| Alias | 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 |
| Apparentées≠ | 5 | 4 |
| Résumé≠ | 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. |
| ScholarGateJeu de données ↗ |
|
|