Online Heuristic Algorithm of Representation for Time-series Based on Polygonal Boundary Reduction
Yingjun Weng · Jisuanji gongcheng · 2004
The novel online heuristic algorithm of representation based on polygonal boundary reduction is presented in detail. The quality of approximation is as good as polygonal boundary reduction, and it can process the data online in a constant buffer. The number of segments is automatically computed due to the inherent heuristic searching. Higher quality of approximation is accomplished in simulation on stochastic time-series shows that, and also lower computing complexity does.