Abstract
We compare pre-processing time series data using Complexity Pursuit (CP) 2 and Logarithm Complexity Pursuit (LCP) [2] with a view to subsequently using a multi-layer perceptron (MLP) to forecast on the data set. Our rationale [1] is that forecasting the underlying factors will be easier than forecasting the original time series which is a combination of these factors. The projections of the data onto the filters found by the pre-processing method were fed into the MLP and it was trained to find Least Mean Square Error (LMSE). Both methods find interesting structure in the time series but LCP is more robust and achieves the best (in terms of least mean square error) performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Han, Y. and Fyfe, C. A Comparative Study of Mixtures of Principal Component Analysis Forecasts and Factor Analysis Forecasts. The Third ICSC Conference on Soft Computing, SOCO2001.
Han, Y. and Fyfe, C. Finding Underlying factors in Time Series, Cybernetics and Systems, March 2002
Hyvärinen, A. 2001. Complexity Pursuit: Separating interesting components from time series. Neural Computation, 13: 883–898
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, Y., Fyfe, C. (2002). Complexity Pursuit for Financial Prediction. In: Yin, H., Allinson, N., Freeman, R., Keane, J., Hubbard, S. (eds) Intelligent Data Engineering and Automated Learning — IDEAL 2002. IDEAL 2002. Lecture Notes in Computer Science, vol 2412. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45675-9_59
Download citation
DOI: https://doi.org/10.1007/3-540-45675-9_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44025-3
Online ISBN: 978-3-540-45675-9
eBook Packages: Springer Book Archive