New Algorithms for Multi-Step Ahead Forecasting

New Algorithms for Multi-Step Ahead Forecasting

AngličtinaMäkká väzbaTlač na objednávku
Arif, Muhammad
VDM Verlag Dr. Müller
EAN: 9783639249811
Tlač na objednávku
Predpokladané dodanie v piatok, 28. augusta 2026
60,27 €
Bežná cena: 66,97 €
Zľava 10 %
ks
Chcete tento titul ešte dnes?
kníhkupectvo Megabooks Banská Bystrica
nie je dostupné
kníhkupectvo Megabooks Bratislava
nie je dostupné
kníhkupectvo Megabooks Košice
nie je dostupné

Podrobné informácie

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
Typ produktu Mäkká väzba
Vydavateľ VDM Verlag Dr. Müller
Dátum vydania 14. apríla 2010
Stránky 160
Jazyk English
Rozmery 229 x 152 x 9
Krajina Germany
Čitatelia General
Autori Arif, Muhammad; Rahat, Syed
Informácie o výrobcovi
Kontaktné informácie výrobcu momentálne nie sú dostupné online, na náprave intenzívne pracujeme. Ak informáciu potrebujete, napíšte nám na [email protected], radi vám ju poskytneme.