A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
A parallel dimensionality reduction for time-series data and some of its applications
2011
International Journal of Intelligent Information and Database Systems
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
doi:10.1504/ijiids.2011.037703
fatcat:mzh2cmnuunaapi3bumuyylvkla