Parallel Algorithm to Detect Structural Changes in Time Series


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

Analysis of long time series is relevant in many current applications. These investigations are usually carried out on multiprocessor computers (supercomputers). However, supercomputer calculations are efficient only if the time-series processing algorithms are sufficiently parallelized. In this article, we propose a parallel algorithm that detects shift points of the time-series mean — a highly important task in many applications. The algorithm breaks the time series into segments and looks for shift points on each segment using a statistical test. The critical values have been calculated for this test. An additional test reduces the number of false detections.

About the authors

I. M. Nikol’skii

Faculty of Computational Mathematics and Cybernetics, Moscow State University

Author for correspondence.
Email: oliv_mail@mail.ru
Russian Federation, Moscow

K. K. Furmanov

Faculty of Computational Mathematics and Cybernetics, Moscow State University

Email: oliv_mail@mail.ru
Russian Federation, Moscow

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2016 Springer Science+Business Media New York