ACM Home Page
Please provide us with feedback. Feedback
Robust periodicity detection algorithms
Full text PdfPdf (189 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the 15th ACM international conference on Information and knowledge management table of contents
Arlington, Virginia, USA
POSTER SESSION: Posters table of contents
Pages: 874 - 875  
Year of Publication: 2006
ISBN:1-59593-433-2
Authors
S. Parthasarathy  Ohio State University
S. Mehta  Ohio State University
S. Srinivasan  Ohio State University
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 58,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1183614.1183774
What is a DOI?

ABSTRACT

Periodicity detection is an important pre-processing step for many time series algorithms. It provides important information about the structural properties of a time series. Feature vectors based on periodicity can be used for clustering, classification, abnormality detection, and human motion understanding. The periodicity detection task is not difficult in case of simple and uncontaminated signal. Unfortunately, most of the real datasets exhibit one or more of the following properties: i) non-stationarity, ii) interlaced cyclic patterns and iii) data contamination, which makes the period detection extremely challenging. A seemingly straightforward solution is to develop individual specialized algorithms for handling each case separately. However, determining if a time series is non-stationary or is contaminated in itself is an extremely difficult task. In this article, we propose generic algorithms which can detect periods in complex, noisy and incomplete datasets. The algorithm leverages the frequency characterization and autocorrelation structure inherent in a time series to estimate its periodicity. We extend the methods to handle non-stationary time series by tracking the candidate periods using a Kalman filter. We also address the interesting problem of finding multiple interlaced periodicities.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Michail Vlachos et al. On periodicity detection and structural periodic similarity. In SDM, 2005.
 
2
P. P. Kanjilal et al. Robust method for periodicity detection and characterization of irregular cyclical series in terms of embedded periodic components. Phys. Rev. E, 59(4):4013--4025, 1999.
 
3
Srinivasan Parthasarathy et al. Robust periodicity detection algorithms. Technical Report OSU-CISRC-3/06-TR29.

Collaborative Colleagues:
S. Parthasarathy: colleagues
S. Mehta: colleagues
S. Srinivasan: colleagues