Moving average randomized tree

DOI10.1007/S10994-025-06978-9MaRDI QIDQ7249852zbMATH OpenFDO

Authors Vinay Kumar Giri, Rahul Goswami

Publication date 19 May 2026

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10994-025-06978-9

zbMATH Keywords

backtestingmoving averagetree ensembletrend prediction

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• Deep neural networks, gradient-boosted trees, random forests: statistical arbitrage on the S\&P 500
• Extremely randomized trees
• Greedy function approximation: A gradient boosting machine.
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• Random forests
• The use of ranks to avoid the assumption of normality implicit in the analysis of variance.

This page was built for publication: Moving average randomized tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7249852)