Title: A parallel dimensionality reduction for time-series data and some of its applications

Authors: Hoang Chi Thanh, Nguyen Quang Thanh

Addresses: Department of Informatics, Hanoi University of Science, VNUH, 334 Nguyen Trai Rd., Hanoi, Vietnam. ' Da Nang Department of Information and Communication, 15 Quang Trung Str., Da Nang, Vietnam

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.

Keywords: time-series data; dimensionality reduction; data matching; minimum bounding rectangles; MBR; planar geometric blocks.

DOI: 10.1504/IJIIDS.2011.037703

International Journal of Intelligent Information and Database Systems, 2011 Vol.5 No.1, pp.39 - 48

Published online: 21 Oct 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article