Please use this identifier to cite or link to this item:
Title: A parallel dimensionality reduction for time-series data and some of its applications
Authors: Hoang, Chi Thanh
Nguyen, Quang Thanh
Keywords: Time-series data;Database;Dimensionality reduction;Matching problem
Issue Date: 2011
Publisher: Elsevier
Abstract: The subsequence matching in a large time-series database has been an interesting problem. Many methods havebeen proposed that cope with this problem in an adequate extent. One ofthe good ideas is reducing properly the dimensionality of time-series data. In this paper, we propose a new method to reduce the dimensionality of high-dimensional time-series 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. The method is used to time-series datamatching problem and it decreases drastically the complexity of the corresponding algorithm. The method preserves planar geometric blocks and it is also applied to minimum bounding rectangles as well
Description: International Journal of Intelligent Information and Database Systems 5(1), pp. 39-48
Appears in Collections:Bài báo của ĐHQGHN trong Scopus

Files in This Item:

  • File : BS2011.177.pdf
  • Description : 
  • Size : 194.5 kB
  • Format : Adobe PDF

  • Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.