Buscar
Mostrando ítems 1-2 de 2
Optimal online time-series segmentation
(Springer, 2024)
When time series are processed, the difficulty increases with the size of the series. This fact is aggravated when time series are processed online, since their size increases indefinitely. Therefore, reducing their number ...
A new approach for optimal offline time-series segmentation with error bound guarantee
(Elsevier, 2021)
This paper proposes a new optimal approach, called OSFS, based on feasible space (FS) Liu et al. (2008)[, that minimizes the number of segments of the approximation and guarantees the error bound using the L∞-norm. On the ...