New Algorithms for Multi-Step Ahead Forecasting

New Algorithms for Multi-Step Ahead Forecasting

EnglishPaperback / softbackPrint on demand
Arif, Muhammad
VDM Verlag Dr. Müller
EAN: 9783639249811
Print on demand
Delivery on Friday, 21. of August 2026
€60.27
Common price €66.97
Discount 10%
pc
Do you want this product today?
Oxford Bookshop Banská Bystrica
not available
Oxford Bookshop Bratislava
not available
Oxford Bookshop Košice
not available

Detailed information

History tells that every human being desire to foresee, comprehend and ultimately explore the future. Multi-step ahead forecasting is a challenging research area due to propagation of forecasting errors with the increase of forecasting steps. Two interesting architectures based on nearest neighbor method are proposed. Importance of selection criteria in nearest neighbor search plays an important role in multi-step ahead forecasting. Effect of up-sampling of time series and change of effective embedding dimension on the forecasting errors is studied in detail. Effect of five interpolation schemes for up-sampling and comparison of three distance metrics for nearest neighbor search on forecasting performance is also included. A hybrid selection criterion of nearest neighbor with avoidance of biasing is found to be very effective in multi-step ahead forecasting. In the end, predictability analysis of proposed algorithms on ten benchmark time series highlight the effectiveness of the forecasting algorithms in the scenarios of series collected from different kinds of dynamic systems. This book is based on the PhD work of Mr. Rahat Abbas.
EAN 9783639249811
ISBN 363924981X
Binding Paperback / softback
Publisher VDM Verlag Dr. Müller
Publication date April 14, 2010
Pages 160
Language English
Dimensions 229 x 152 x 9
Country Germany
Readership General
Authors Arif, Muhammad; Rahat, Syed
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.