Scalable Algorithm for Subsequence Similarity Search in Very Large Time Series Data on Cluster of Phi KNL

Author(s):  
Yana Kraeva ◽  
Mikhail Zymbler
Author(s):  
Martin Suntinger ◽  
Hannes Obweger ◽  
Josef Schiefer ◽  
Philip Limbeck ◽  
Günther Raidl

2005 ◽  
Vol 620 (2) ◽  
pp. 1033-1042 ◽  
Author(s):  
David T. F. Weldrake ◽  
Penny D. Sackett

2011 ◽  
Vol 14 (2) ◽  
pp. 71-79
Author(s):  
Anh Tuan Duong

Time series data occur in many real life applications, ranging from science and engineering to business. In many of these applications, searching through large time series database based on query sequence is often desirable. Such similarity-based retrieval is also the basic subroutine in several advanced time series data mining tasks such as clustering, classification, finding motifs, detecting anomaly patterns, rule discovery and visualization. Although several different approaches have been developed, most are based on the common premise of dimensionality reduction and spatial access methods. This survey gives an overview of recent research and shows how the methods fit into a general framework of feature extraction.


Sign in / Sign up

Export Citation Format

Share Document