ScholarGate
Assistent

Methoden vergelijken

Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.

Neurale ODE×Random Forest×
VakgebiedDeep learningMachine learning
FamilieMachine learningMachine learning
Jaar van ontstaan20182001
GrondleggerChen, T. Q. et al.Breiman, L.
TypeContinuous-depth neural network (ODE-parameterised dynamics)Ensemble (bagging of decision trees)
Oorspronkelijke bronChen, 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 ↗
AliassenNöral Diferansiyel Denklem (Neural ODE), neural ordinary differential equation, continuous-depth network, ODE-NetRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
Verwant44
SamenvattingA 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.
ScholarGateGegevensset
  1. v1
  2. 2 Bronnen
  3. PUBLISHED
  1. v1
  2. 2 Bronnen
  3. PUBLISHED

Naar zoeken Dia's downloaden

ScholarGateMethoden vergelijken: Neural ODE · Random Forest. Geraadpleegd op 2026-06-17 via https://scholargate.app/nl/compare