विधियों की तुलना करें

	न्यूरल ओडीई (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).	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
उपनाम	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.