A wrapper for projection pursuit learning

Holschuh L.M.; Lima C.A.M.; Von Zuben F.J.

A wrapper for projection pursuit learning

item.page.type

Artigo de evento

Date

2007

item.page.ispartof

IEEE International Conference on Neural Networks - Conference Proceedings

item.page.citationsscopus

2

Authors

Holschuh L.M.
Lima C.A.M.
Von Zuben F.J.

Abstract

Constructive algorithms have shown to be reliable and effective methods for designing Artificial Neural Networks (ANN) with good accuracy and generalization capability, yet with parsimonious network structures. Projection Pursuit Learning (PPL) has demonstrated great flexibility and effectiveness in performing this task, though presenting some difficulties in the search for appropriate projection directions in input spaces with high dimensionality. Due to the existence of high-dimensional input spaces in the context of time series prediction, mainly under the existence of long-term dependencies in the time series, we propose here a method based on the wrapper methodology to perform variable selection, so that only a subset of highly-informative lags is going to be considered as the regression vector. The Yearly Sunspot Number time series is adopted as a case study and comparative analysis is performed considering alternative approaches in the literature, guiding to competitive results. ©2007 IEEE.

item.page.scopussubject

Input spaces , Joint conference , Projection pursuit learning , Time-series