DSpace
 

Tai Nguyen So - Vietnam National University, Ha Noi - VNU >
ĐẠI HỌC QUỐC GIA HÀ NỘI - VIETNAM NATIONAL UNIVERSITY, HANOI >
BÀI BÁO ĐĂNG TRÊN SCOPUS >
2009-2010 VNU-DOI-Publications >

Search

Please use this identifier to cite or link to this item: http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/7333

Title: Parallel dimensionality reduction transformation for time-series data
Authors: H.C., Thanh
Keywords: Dimensionality reduction
Matching problem
Minimum bounding rectangle
Time-series data
Issue Date: 2009
Publisher: Proceedings - 2009 1st Asian Conference on Intelligent Information and Database Systems, ACIIDS 2009
Citation: Art. No.: 5175976, Page 104-108
Abstract: 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.
URI: http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/7333
ISBN: 9.78E+12
Appears in Collections:2009-2010 VNU-DOI-Publications

Files in This Item:

File Description SizeFormat
287.pdf45.56 kBAdobe PDFView/Open

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

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback