DocumentCode
2864478
Title
Making subsequence time series clustering meaningful
Author
Chen, Jason R.
Author_Institution
Dept. of Inf. Eng., Australian Nat. Univ., Canberra, ACT, Australia
fYear
2005
fDate
27-30 Nov. 2005
Abstract
The startling claim was made that sequential time series clustering is meaningless. This has important consequences for a significant amount of work in the literature, since such a claim invalidates this work\´s contribution. In this paper, we show that sequential time series clustering is not meaningless, and that the problem highlighted in these works stem from their use of the Euclidean distance metric as the distance measure in the subsequence vector space. As a solution, we consider quite a general class of time series, and propose a regime based on two types of similarity that can exist between subsequence vectors, which give rise naturally to an alternative distance measure to Euclidean distance in the subsequence vector space. We show that, using this alternative distance measure, sequential time series clustering can indeed be meaningful. We repeat a key experiment in the work on which the "meaningless" claim was based, and show that our method leads to a successful clustering outcome.
Keywords
pattern clustering; statistical analysis; time series; Euclidean distance metric; distance measure; sequential time series clustering; subsequence vector space; Clustering algorithms; Data mining; Euclidean distance; Feature extraction; Indexing; Information science; Mobile robots; Stock markets; Time measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Mining, Fifth IEEE International Conference on
ISSN
1550-4786
Print_ISBN
0-7695-2278-5
Type
conf
DOI
10.1109/ICDM.2005.91
Filename
1565669
Link To Document