Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Нейронні Звичайні Диференціальні Рівняння (Neural ODE)× | Випадковий ліс× | |
|---|---|---|
| Галузь≠ | Глибоке навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2018 | 2001 |
| Автор методу≠ | Chen, T. Q. et al. | Breiman, L. |
| Тип≠ | Continuous-depth neural network (ODE-parameterised dynamics) | Ensemble (bagging of decision trees) |
| Основоположне джерело≠ | Chen, T. Q., Rubanova, Y., Bettencourt, J. & Duvenaud, D. (2018). Neural Ordinary Differential Equations. Advances in Neural Information Processing Systems (NeurIPS). link ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Інші назви | Nöral Diferansiyel Denklem (Neural ODE), neural ordinary differential equation, continuous-depth network, ODE-Net | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Пов'язані | 4 | 4 |
| Підсумок≠ | A Neural ODE, introduced by Chen and colleagues in 2018, models a hidden state as the continuous solution of an ordinary differential equation whose dynamics are parameterised by a neural network. It generalises the limiting case of residual connections, making it well suited to irregularly spaced time series and physics-based modelling. | 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Набір даних ↗ |
|
|