کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
534451 | 870254 | 2010 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A tree-construction search approach for multivariate time series motifs discovery
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
This paper examines an unsupervised search method to discover motifs from multivariate time series data. Our method first scans the entire series to construct a list of candidate motifs in linear time, the list is then used to populate a sparse self-similarity matrix for further processing to generate the final selections. The proposed algorithm is efficient in both running time and memory storage. To demonstrate its effectiveness, we applied it to search for repeating segments in both music and sensory data sets. The experimental results showed that the proposed method can efficiently detect repeating segments as compared to well-known methods such as self-similarity matrix search and symbolic aggregation approximation approaches.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition Letters - Volume 31, Issue 9, 1 July 2010, Pages 869–875
Journal: Pattern Recognition Letters - Volume 31, Issue 9, 1 July 2010, Pages 869–875
نویسندگان
L. Wang, E.S. Chng, H. Li,