ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

双向循环神经网络×随机森林×
领域深度学习机器学习
方法族Machine learningMachine learning
起源年份19972001
提出者Schuster, M. & Paliwal, K.K.Breiman, L.
类型Recurrent neural network (sequence model)Ensemble (bagging of decision trees)
开创性文献Schuster, M. & Paliwal, K.K. (1997). Bidirectional Recurrent Neural Networks. IEEE Transactions on Signal Processing, 45(11), 2673–2681. DOI ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗
别名Çift Yönlü RNN / BiLSTM / BiGRU, bidirectional recurrent neural network, BiLSTM, BiGRURastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
相关54
摘要A Bidirectional RNN, introduced by Schuster and Paliwal in 1997, processes a sequence in both forward and backward directions so that every position has access to its full surrounding context. With LSTM or GRU cells (BiLSTM/BiGRU) it is the standard approach for named-entity recognition, sequence labelling, and speech recognition.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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Bidirectional RNN · Random Forest. 于 2026-06-18 检索自 https://scholargate.app/zh/compare