Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| LSTM× | Autoenkoder× | |
|---|---|---|
| Dziedzina | Uczenie głębokie | Uczenie głębokie |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1997 | 2006 |
| Twórca≠ | Hochreiter, S. & Schmidhuber, J. | Hinton, G.E. & Salakhutdinov, R.R. |
| Typ≠ | Recurrent neural network (gated memory cell) | Neural network (encoder-decoder) |
| Źródło pierwotne≠ | Hochreiter, S. & Schmidhuber, J. (1997). Long Short-Term Memory. Neural Computation, 9(8), 1735–1780. DOI ↗ | Hinton, G.E. & Salakhutdinov, R.R. (2006). Reducing the Dimensionality of Data with Neural Networks. Science, 313(5786), 504–507. DOI ↗ |
| Inne nazwy | LSTM (Uzun Kısa Dönem Bellek Ağı), long short-term memory, LSTM network, recurrent neural network with memory cells | Otokodlayıcı (Autoencoder), otokodlayıcı, auto-encoder, encoder-decoder network |
| Pokrewne≠ | 5 | 4 |
| Podsumowanie≠ | 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. | An autoencoder is an encoder-decoder neural network, popularised by Hinton and Salakhutdinov in 2006, that compresses data into a low-dimensional latent code and then reconstructs it, enabling dimensionality reduction and anomaly detection. By learning to rebuild its own input through a narrow bottleneck, it discovers a compact representation of the data. |
| ScholarGateZbiór danych ↗ |
|
|