The problem of predicting time series originating from mixtures of signals from independent dynamical systems is considered. We show that the problem of finding representations for the dynamics of such systems is hard if the mixing structure of the system is not taken into account. If, on the contrary, the sources can be unmixed in a preprocessing step the complexity of system identification may be drastically reduced. This is demonstrated using chaotic maps. It is shown that applications of methods for blind separation of sources can substantially improve both: prediction performance and prediction horizon.
CITATION STYLE
Pawelzik, K., Miiller, K. R., & Kohlmorgen, J. (1996). Prediction of mixtures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1112 LNCS, pp. 127–132). Springer Verlag. https://doi.org/10.1007/3-540-61510-5_25
Mendeley helps you to discover research relevant for your work.