To cite this paper use one of the standards below:
With the advancement of wearable devices, it has become possible to simultaneously collect several biomedical signals through multiple devices, such as smartwatches and performance monitoring straps. A central challenge in this collection is the integration of this physiological data from independent sensors to create a unified database. These signals, characterized as time series, present noise and distortions resulting from physical factors (such as user movement or momentary interruptions in capture), which prevents the series from being identical or just outdated, requiring a robust alignment to ensure the fidelity of clinical and performance information.
This work proposes the development of mathematical programming formulations, specifically using goal programming, aimed at the optimal alignment of these time series. The alignment process plays a key role in time series analysis, as time distortions or sampling inconsistencies between signals can significantly degrade the performance of predictive models. Traditional methods, such as Dynamic Time Warping (DTW) and its approximations (including FastDTW), offer efficient heuristic alignments, but in some applications lack the customization allowed by mathematical programming techniques . Different from dynamic programming-based approaches (DTW
for example), which may present limitations in the inclusion of complex structural constraints, the use of mathematical programming allows for rigorous and flexible model customization
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper