Scale Invariant Multi-length Motif Discovery [chapter]

Yasser Mohammad, Toyoaki Nishida
2014 Lecture Notes in Computer Science  
Discovering approximately recurrent motifs (ARMs) in timeseries is an active area of research in data mining. Exact motif discovery was later defined as the problem of efficiently finding the most similar pairs of timeseries subsequences and can be used as a basis for discovering ARMs. The most efficient algorithm for solving this problem is the MK algorithm which was designed to find a single pair of timeseries subsequences with maximum similarity at a known length. Available exact solutions
more » ... the problem of finding top K similar subsequence pairs at multiple lengths (which can be the basis of ARM discovery) are not scale invariant. This paper proposes a new algorithm for solving this problem efficiently using scale invariant distance functions and applies it to both real and synthetic dataset.
doi:10.1007/978-3-319-07467-2_44 fatcat:x2sst5c7lbh7ncqeahxxiamfl4