A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Efficient and robust feature extraction and pattern matching of time series by a lattice structure
2001
Proceedings of the tenth international conference on Information and knowledge management - CIKM'01
The efficiency of searching scaling-invariant and shiftinginvariant shapes in a set of massive time series data can be improved if searching is performed on an approximated sequence which involves less data but contains all the significant features. However, commonly used smoothing techniques, such as moving averages and best-fitting polylines, usually miss important peaks and troughs and deform the time series. In addition, these techniques are not, robust, as they often requires users to
doi:10.1145/502628.502631
fatcat:di6nefockjc65g5mcb3x5iefli