Most algorithms for mining or indexing time series data do not operate directly on the original data, but instead they consider alternative representations that include transforms, quantization, approximation, and multi-resolution abstractions. Choosing the best representation and abstraction level for a given task/dataset is arguably the most critical step in time series data mining. In this paper, we investigate techniques that discover the natural intrinsic representation model, dimensionality and alphabet cardinality of a time series. The ability to discover these intrinsic features has implications beyond selecting the best parameters for particular algorithms, as characterizing data in such a manner is useful in its own right and an important sub-routine in algorithms for classification, clustering and outlier discovery. We will frame the discovery of these intrinsic features in the Minimal Description Length (MDL) framework. Extensive empirical tests show that our method is simpler, more general and significantly more accurate than previous methods, and has the important advantage of being essentially parameter-free. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hu, B., Rakthanmanon, T., Hao, Y., Evans, S., Lonardi, S., & Keogh, E. (2013). Towards discovering the intrinsic cardinality and dimensionality of time series using MDL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7070 LNAI, pp. 184–197). Springer Verlag. https://doi.org/10.1007/978-3-642-44958-1_14
Mendeley helps you to discover research relevant for your work.