FINDING OR NOT FINDING RULES IN TIME SERIES

Abstract

Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences has received much attention. In this work we make a surprising claim. Clustering of time series subsequences is completely meaningless. More concretely, clusters extracted from these time series are forced to obey a certain constraint that is pathologically unlikely to be satisfied by any dataset, and because of this, the clusters extracted by any clustering algorithm are essentially random. While this constraint can be intuitively demonstrated with a simple illustration and is simple to prove, it has never appeared in the literature. We can justify calling our claim surprising, since it invalidates the contribution of dozens of previously published papers. We will justify our claim with a theorem, illustrative examples, and a comprehensive set of experiments on reimplementations of previous work.

Citation

Lin, J. and Keogh, E. (2004), "FINDING OR NOT FINDING RULES IN TIME SERIES", Binner, J.M., Kendall, G. and Chen, S.-H. (Ed.) Applications of Artificial Intelligence in Finance and Economics (Advances in Econometrics, Vol. 19), Emerald Group Publishing Limited, Leeds, pp. 175-201. https://doi.org/10.1016/S0731-9053(04)19007-5