Forecasting GDP Growth Using ANN Model with Genetic Algorithm

Message:
Abstract:
Applying nonlinear models to estimation and forecasting economic models are now becoming more common, thanks to advances in computing technology. Artificial Neural Networks (ANN) models, which are nonlinear local optimizer models, have proven successful in forecasting economic variables. Most ANN models applied in Economics use the gradient descent method as their learning algorithm. However, the performance of the ANN models can still be improved by using more flexible and general learning algorithm. In this paper, we develop an ANN model combined with Genetic Algorithm to forecast the Iranian GDP growth. In order to evaluate the performance of the model with other ANN and traditional econometric models, we compare the results of the model with other linear and nonlinear competing models such as ARMA, VAR, and ANN with gradient descent learning algorithm. We use the recently produced extended data on the Iranian GDP from 1937 to 2002. The results indicate that the GA can improve the forecasting performance of ANN model over other standard ANN and econometrics models.
Language:
English
Published:
Iranian Economic Review, Volume:9 Issue: 11, Summer 2004
Pages:
67 to 84
magiran.com/p988084  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!