Real-time segmenting time series data

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

Abstract

There has been increased interest in time series data mining recently. In some cases, approaches of real-time segmenting time series are necessary in time series similarity search and data mining, and this is the focus of this paper. A real-time iterative algorithm that is based on time series prediction is proposed in this paper. Proposed algorithm consists of three modular steps. (1) Modeling: the step identifies an autoregressive moving average (ARMA) model of dynamic processes from a time series data; (2) prediction: this step makes k steps ahead prediction based on the ARMA model of the process at a crisp time point. (3) Change-points detection: the step is what fits a piecewise segmented polynomial regressive model to the time series data to determine whether it contains a new change-point. Finally, high performance of the proposed algorithm is demonstrated by comparing with Guralnik-Srivastava algorithm. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Li, A., He, S., & Qin, Z. (2003). Real-time segmenting time series data. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2642, 178–186. https://doi.org/10.1007/3-540-36901-5_19

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