CÁC BÀI BÁO KHOA HỌC 16:52:07 Ngày 25/01/2020 GMT+7
Parallel dimensionality reduction transformation for time-series data

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.


 Thanh H.C.
   287.pdf    Gửi cho bạn bè
  Từ khóa : Dimensionality reduction; High-dimensional; Matching problem; Minimum bounding rectangle; Subsequence matching; Time-series data; Cosine transforms; Data reduction; Discrete cosine transforms; Discrete Fourier transforms; Geometry; Database systems