Article

Applied Intelligence

, Volume 32, Issue 3, pp 267-278

STNR: A suffix tree based noise resilient algorithm for periodicity detection in time series databases

  • Faraz RasheedAffiliated withDepartment of Computer Science, University of Calgary
  • , Reda AlhajjAffiliated withDepartment of Computer Science, University of Calgary Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Periodicity detection has been used extensively in predicting the behavior and trends of time series databases. In this paper, we present a noise resilient algorithm for periodicity detection using suffix trees as an underlying data structure. The algorithm not only calculates symbol and segment periodicity, but also detects the partial (or sequence) periodicity in time series. Most of the existing algorithms fail to perform efficiently in presence of noise; although noise is an inevitable constituent of real world data. The conducted experiments demonstrate that our algorithm performs more efficiently compared to other algorithms in presence of replacement, insertion, deletion or a mixture of any of these types of noise.

Keywords

Time series Periodicity detection Suffix tree Segment periodicity Sequence periodicity Noise resilient