Algorithm for matching sets of time series

3Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Time series are time-stamped sequences of values which represent a parameter of the observed processes in subsequent time points. Given a set of time series describing a set of similar processes, the model of the behavior of processes is constructed as a range of classification trees which describe the characteristics of each particular time point in series. An algorithm for matching a sequence of values with the model is used for searching common patterns in the sets of time series, and for predicting the starting time points of undated time series. The algorithm was developed and analyzed in the frame of the study of tree-ring time series. The implementation and the empirical analysis of the algorithm on the tree-ring time series are presented.

Cite

CITATION STYLE

APA

Savnik, I., Lausen, G., Kahle, H. P., Spiecker, H., & Hein, S. (2000). Algorithm for matching sets of time series. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1910, pp. 277–288). Springer Verlag. https://doi.org/10.1007/3-540-45372-5_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free