|
|||||
|
|
A scalable dynamic programming scheme for the computation of optimal k-segments for ordered data |
|
| Affiliation: | 1. Department of Mathematics and Statistics, University of Turku, Turku FI-20014, Finland;2. Faculty of Science and Technology, Federation University Australia, Victoria, Australia |
| Abstract: | |
| Keywords: | Dynamic programming Parsimonious temporal aggregation Piecewise constant approximation v-optimal histograms Data approximation |
| 本文献已被 ScienceDirect 等数据库收录！ | |