A. Hyvärinen. Complexity pursuit: Separating interesting components from time-series To appear in Neural Computation.
Postscript   gzipped PostScript .

Abstract: A generalization of projection pursuit for time series, i.e.\ signals with time structure, is introduced. The goal is to find projections of time series that have interesting structure. We define the interestingness using criteria related to Kolmogoroff Complexity or coding length: Interesting signals are those that can be coded with a short code length. We derive a simple approximation of coding length that takes into account both the nongaussianity and the autocorrelations of the time series. Also, we derive a simple algorithm for its approximative optimization. The resulting method is closely related to blind separation of nongaussian, time-dependent source signals.

Back to on-line publications