A time series with natural or artificially created inhomogeneities can be segmented into parts with different statistical characteristics. In this study, three algorithms are presented for time series segmentation; the first is based on dynamic programming and the second and the third—the latter being an improved version of the former—are based on the branch‐and‐bound approach. The algorithms divide the time series into segments using the first order statistical moment (average). Tested on real world time series of several hundred or even over a thousand terms the algorithms perform segmentation satisfactorily and fast.
No takes yet. Share an insight, caveat, or question.
Aksoy et al. (2008) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: