Compară metode

	Unitate Recurentă Gated (GRU)	Mecanismul de atenție	Pădurea Aleatoare (Random Forest)
Domeniu	Învățare profundă	Învățare profundă	Învățare automată
Familie	Machine learning	Machine learning	Machine learning
Anul apariției	2014	2015	2001
Autorul original	Cho, K. et al.	Bahdanau, D.; Luong, M.T.	Breiman, L.
Tip	Gated recurrent neural network unit	Neural attention layer (encoder-decoder)	Ensemble (bagging of decision trees)
Sursa seminală	Cho, K. et al. (2014). Learning Phrase Representations using RNN Encoder–Decoder for Statistical Machine Translation. EMNLP.	Bahdanau, D., Cho, K. & Bengio, Y. (2015). Neural Machine Translation by Jointly Learning to Align and Translate. ICLR.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
Denumiri alternative	Kapılı Tekrarlayan Birim (GRU), gated recurrent unit, gated recurrent network	Dikkat Mekanizması (Bahdanau / Luong Attention), dikkat mekanizmasi, neural attention, additive attention	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Înrudite	5	5	4
Rezumat	The Gated Recurrent Unit (GRU) is a gated recurrent neural network cell introduced by Cho and colleagues in 2014 that captures long-range dependencies in sequential data using update and reset gates, achieving performance comparable to LSTM with fewer parameters.	The attention mechanism, introduced by Bahdanau, Cho and Bengio in 2015 and refined by Luong, Pham and Manning the same year, lets a sequence decoder dynamically learn which of the encoder's outputs to focus on at each step. Before the Transformer, it substantially improved machine-translation quality by freeing models from compressing an entire input into a single fixed vector.	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.