You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In a very recent paper it is suggested to obtain an adaptive recurrence threshold based on local maximum attractor densities/distances. Basically, the distance matrix gets scanned using a sliding window (window size is a free parameter, but can be related to the decorrelation time of the time series) and for each window the maximum distance is picked. In turn, this local maximum distance will be used to scale the recurrence threshold accordingly.
The paper and the shown results sound promising and the effort to implement it (and also the computational complexity itself) seems to be manageable I suppose.
The text was updated successfully, but these errors were encountered:
In a very recent paper it is suggested to obtain an adaptive recurrence threshold based on local maximum attractor densities/distances. Basically, the distance matrix gets scanned using a sliding window (window size is a free parameter, but can be related to the decorrelation time of the time series) and for each window the maximum distance is picked. In turn, this local maximum distance will be used to scale the recurrence threshold accordingly.
The paper and the shown results sound promising and the effort to implement it (and also the computational complexity itself) seems to be manageable I suppose.
The text was updated successfully, but these errors were encountered: