Skip to main content
Search

Mercatorum University

1 related articles

Subscribe to updates
  1. arXiv

    Curve classifiers stop relying on one whole-curve decomposition: window-level components let GL-FRF beat a tuned full-curve forest on 16 of 20 UCR datasets

    Functional random forests usually take one principal-component decomposition of the whole curve, which can dilute discriminative features confined to short intervals. GL-FRF stacks a tuned full-curve forest with one forest per window using penalised convex weights, and the full-curve forest remains a feasible solution; on 20 UCR datasets it improved on a tuned full-curve forest with the same number of trees on 16, with Brier score reductions up to 0.21, significant after Holm adjustment. WC-FRF trains a single forest on concatenated window scores, was more accurate on 13 real datasets, but degraded sharply in simulated settings where the signal required the full curve.

You’re all caught up