The article introduces very simple and quite effective algorithm for constant state detection in time series. The algorithm, based on sliding window of variable length, searches a sections of time series with some given minimal length, that have all the values in some given range. It is shown that the computational complexity of afore- mentioned algorithm is O(N log N), where N is the length of time series.
Keino, A. (2024). Simple and effective algorithm for constant state detection in time series. [version 1] [preprint]. Mathematics.
No reviews to show. Please remember to LOG IN as some reviews may be only visible to specific users.