Dimensionality reduction Matching problem Minimum bounding rectangle Time-series data
Issue Date:
2009
Publisher:
Proceedings - 2009 1st Asian Conference on Intelligent Information and Database Systems, ACIIDS 2009
Citation:
Art. No.: 5175976, Page 104-108
Abstract:
The subsequence matching in large timeseries databases has been being an interesting problem.
Many methods have been proposed that cope with this problem in an adequate extend. One of good ideas is
reducing properly the dimensionality of time-series data. In this paper, we propose a method to reduce the
dimensionality of high-dimensional timeseries data. The method is simpler than existing ones based on the
discrete Fourier transform and the discrete cosine transform. Furthermore, our dimensionality reduction may
be executed in parallel. It preserves planar geometric blocks and may be applied to minimum bounding
rectangles as well. ?? 2009 IEEE.