A wrapper for projection pursuit learning

dc.contributor.authorHolschuh L.M.
dc.contributor.authorLima C.A.M.
dc.contributor.authorVon Zuben F.J.
dc.date.accessioned2024-03-13T01:39:05Z
dc.date.available2024-03-13T01:39:05Z
dc.date.issued2007
dc.description.abstractConstructive 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.
dc.description.firstpage2892
dc.description.lastpage2897
dc.identifier.doi10.1109/IJCNN.2007.4371419
dc.identifier.issn1098-7576
dc.identifier.urihttps://dspace.mackenzie.br/handle/10899/37605
dc.relation.ispartofIEEE International Conference on Neural Networks - Conference Proceedings
dc.rightsAcesso Restrito
dc.titleA wrapper for projection pursuit learning
dc.typeArtigo de evento
local.scopus.citations2
local.scopus.eid2-s2.0-51749089013
local.scopus.subjectInput spaces
local.scopus.subjectJoint conference
local.scopus.subjectProjection pursuit learning
local.scopus.subjectTime-series
local.scopus.updated2024-05-01
local.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=51749089013&origin=inward
Arquivos