ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

ニューラルODE×ランダムフォレスト×
分野深層学習機械学習
系統Machine learningMachine learning
提唱年20182001
提唱者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-NetRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
関連44
概要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データセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Neural ODE · Random Forest. 2026-06-17に以下より取得 https://scholargate.app/ja/compare