Authors: Andrei Keino
The article introduces a simple and effective algorithm for constant state detection in the time series. The algorithm, based on the sliding window of variable length, finds all the sections of the time series which have length greater or equal than some given minimal length and have difference between maximal and minimal value in the section less or equal than some given value. It is shown that the computationalcomplexity of the aforementioned algorithm is O(N log N), where N is the length of time series.
Comments: 6 Pages.
Download: PDF
[v1] 2025-02-06 21:52:46
[v2] 2025-02-12 21:15:25
[v3] 2025-02-22 00:44:14
Unique-IP document downloads: 420 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.