A new algorithm for segmenting data from time series
暂无分享,去创建一个
This paper addresses the problem of dividing a time series into segments, where the data in each segment, is generated by a different underlying linear model. The technique is used to identify changes in the process generating the data. The identification of changes is recast as a shortest path problem which is solved using dynamic programming. The algorithm determines the total number of jumps within the data, the location of these jumps and the order of the model within each segment. Results of the application of the algorithm to the analysis of retail sales data are presented.
[1] F. Gustafsson. Estimation of Discrete Parameters in Linear Systems , 1993 .
[2] Alan S. Willsky,et al. A survey of design methods for failure detection in dynamic systems , 1976, Autom..
[3] G. F. Bryant,et al. A solution to the segmentation problem based on dynamic programming , 1994, 1994 Proceedings of IEEE International Conference on Control and Applications.
[4] J. Rissanen. Estimation of structure by minimum description length , 1982 .