A parallel dimensionality reduction for time-series data and some of its applications. (27th December 2010)

• Record Type: Journal Article
• Authors: Thanh, Hoang Chi; Thanh, Nguyen Quang
• Is Part Of: International journal of intelligent information and database systems. Volume 5:Number 1(2011)
• Page Start: 39
• Page End: 48
• Publication Date: 2010-12-27
• Subjects: time-series data -- dimensionality reduction -- data matching -- minimum bounding rectangles -- MBR -- planar geometric blocks; Database management -- Computer programs -- Periodicals; Information retrieval -- Computer programs -- Periodicals; Information storage and retrieval systems -- Computer programs -- Periodicals; Artificial intelligence -- Periodicals; Expert systems (Computer science) -- Periodicals; Intelligent agents (Computer software) -- Periodicals; 006.33
• Languages: English
• ISSNs: 1751-5858

Abstract

The subsequence matching in a large time-series database has been an interesting problem. Many methods have been proposed that cope with this problem in an adequate extent. One of the 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 data matching 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.