Optimal online time-series segmentation
Autor
Carmona Poyato, Ángel
Fernández García, Nicolás Luis
Madrid-Cuevas, F.J.
Muñoz-Salinas, Rafael
Romero Ramírez, Francisco J.
Editor
SpringerFecha
2024Materia
Optimal time series segmentationSegmentation online versus offline
Error bound guarantee
L∞-norm
METS:
Mostrar el registro METSPREMIS:
Mostrar el registro PREMISMetadatos
Mostrar el registro completo del ítemResumen
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 of points, without significant loss of information, is an important field of research. This article proposes an optimal online segmentation method, called OSFS-OnL, which guarantees that the number of segments is minimal, that a preset error limit is not exceeded using the -norm, and that for that number of segments the value of the error corresponding to the -norm is minimized. This new proposal has been compared with the optimal OSFS offline segmentation method and has shown better computational performance, regardless of its flexibility to apply it to online or offline segmentation.
Descripción
Embargado hasta 26/12/2024 Datos de investigación disponibles en: https://github.com/ma1capoa/OSFS_Method/tree/main/TimeSeriesFiles