The comparison of algorithms in change-points problem.
A fast two stage (TS) algorithm by window method is proposed. First, we apply the window method by using the log-likelihood ratio measure to find a subset of candidate change-points; and use dynamic programming (DP) algorithm on the chosen subset to obtain good initial change-points which will be pr...
| 发表在: | Journal of Applied Science and Engineering 15, 1 (2012). |
|---|---|
| 主要作者: | |
| 格式: | 文件 |
| 语言: | English |
| 主题: |