Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

Kernel methods for short-term spatio-temporal wind prediction

Dowell, Jethro and Weiss, Stephan and Infield, David (2015) Kernel methods for short-term spatio-temporal wind prediction. In: 2015 IEEE Power and Energy Society General Meeting. IEEE. ISBN 9781467380409

[img]
Preview
Text (Dowell-Weiss-Infield-IEEEPESGM2015-kernel-methods-for-short-term-spatio-temporal-wind)
Dowell_Weiss_Infield_IEEEPESGM2015_kernel_methods_for_short_term_spatio_temporal_wind.pdf - Accepted Author Manuscript

Download (252kB) | Preview

Abstract

Two nonlinear methods for producing short-term spatio-temporal wind speed forecast are presented. From the relatively new class of kernel methods, a kernel least mean squares algorithm and kernel recursive least squares algorithm are introduced and used to produce 1 to 6 hour-ahead predictions of wind speed at six locations in the Netherlands. The performance of the proposed methods are compared to their linear equivalents, as well as the autoregressive, vector autoregressive and persistence time series models. The kernel recursive least squares algorithm is shown to offer significant improvement over all benchmarks, particularly for longer forecast horizons. Both proposed algorithms exhibit desirable numerical properties and are ripe for further development.