On the Discovery of Weak Periodicities in Large Time Series
Christos Berberidis4
, Ioannis Vlahavas4
, Walid G. Aref5
, Mikhail Atallah5
and Ahmed K. Elmagarmid5 
| (4) |
Department of Informatics, Aristotle University of Thessaloniki, 54006 Thessaloniki, Greece |
| (5) |
Dept. of Computer Sciences, Purdue University, Purdue |
Abstract
The search for weak periodic signals in time series data is an active topic of research. Given the fact that rarely a real
world dataset is perfectly periodic, this paper approaches this problem in terms of data mining, trying to discover weak periodic
signals in time series databases, when no period length is known in advance. In existing time series mining algorithms, the
period length is user-specified. We propose an algorithm for finding approximate periodicities in large time series data,
utilizing autocorrelation function and FFT. This algorithm is an extension to the partial periodicity detection algorithm
presented in a previous paper of ours. We provide some mathematical background as well as experimental results.
Portions of this work were supported by Grant EIA-9903545 from the National Science Foundation, Contract N00014-02-1-0364
from the Office of Naval Research, and by sponsors of the Center for Education and Research in Information Assurance and Security.
References secured to subscribers.