השוואת שיטות

	LSTM	מפענח-מצפין (Autoencoder)	יער אקראי
תחום	למידה עמוקה	למידה עמוקה	למידת מכונה
משפחה	Machine learning	Machine learning	Machine learning
שנת המקור	1997	2006	2001
הוגה השיטה	Hochreiter, S. & Schmidhuber, J.	Hinton, G.E. & Salakhutdinov, R.R.	Breiman, L.
סוג	Recurrent neural network (gated memory cell)	Neural network (encoder-decoder)	Ensemble (bagging of decision trees)
מקור מכונן	Hochreiter, S. & Schmidhuber, J. (1997). Long Short-Term Memory. Neural Computation, 9(8), 1735–1780.	Hinton, G.E. & Salakhutdinov, R.R. (2006). Reducing the Dimensionality of Data with Neural Networks. Science, 313(5786), 504–507.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
כינויים	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	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
קשורות	5	4	4
תקציר	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.	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.