Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| LSTM× | Конволюционна невронна мрежа (Класификация)× | Случайна гора× | |
|---|---|---|---|
| Област≠ | Дълбоко обучение | Дълбоко обучение | Машинно обучение |
| Семейство | Machine learning | Machine learning | Machine learning |
| Година на възникване≠ | 1997 | 1998 | 2001 |
| Създател≠ | Hochreiter, S. & Schmidhuber, J. | LeCun, Y. et al. | Breiman, L. |
| Тип≠ | Recurrent neural network (gated memory cell) | Deep neural network (convolutional) | Ensemble (bagging of decision trees) |
| Основополагащ източник≠ | Hochreiter, S. & Schmidhuber, J. (1997). Long Short-Term Memory. Neural Computation, 9(8), 1735–1780. DOI ↗ | LeCun, Y., Bottou, L., Bengio, Y. & Haffner, P. (1998). Gradient-Based Learning Applied to Document Recognition. Proceedings of the IEEE, 86(11), 2278–2324. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Други названия | LSTM (Uzun Kısa Dönem Bellek Ağı), long short-term memory, LSTM network, recurrent neural network with memory cells | CNN (Evrişimli Sinir Ağı — Sınıflandırma), CNN classification, ConvNet, convolutional network classifier | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Свързани≠ | 5 | 5 | 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. | A Convolutional Neural Network (CNN) is a deep learning model, established by LeCun and colleagues in 1998, that learns local patterns directly from images and structured data to classify them. Stacks of convolutional filters discover increasingly abstract features, so manual feature engineering can be largely reduced. | 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Набор от данни ↗ |
|
|
|