Making Subsequence Time Series Clustering Meaningful
-
Altmetric Citations
Description
Recently, 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...[Show more]
dc.contributor.author | Chen, Jason Robert | |
---|---|---|
dc.coverage.spatial | Houston USA | |
dc.date.accessioned | 2015-12-13T22:49:21Z | |
dc.date.created | November 27 2005 | |
dc.identifier.isbn | 1550-4786 | |
dc.identifier.uri | http://hdl.handle.net/1885/80501 | |
dc.description.abstract | Recently, 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. | |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE Inc) | |
dc.relation.ispartofseries | IEEE International Conference on Data Mining (ICDM 2005) | |
dc.source | Proceedings Fifth IEEE International Conference on Data Mining | |
dc.source.uri | http://www.cacs.louisiana.edu/~icdm05/ | |
dc.subject | Keywords: Clustering algorithms; Data mining; Euclidean distance metric; Vector space; Time series analysis | |
dc.title | Making Subsequence Time Series Clustering Meaningful | |
dc.type | Conference paper | |
local.description.notes | Imported from ARIES | |
local.description.refereed | Yes | |
dc.date.issued | 2005 | |
local.identifier.absfor | 080109 - Pattern Recognition and Data Mining | |
local.identifier.ariespublication | MigratedxPub8770 | |
local.type.status | Published Version | |
local.contributor.affiliation | Chen, Jason Robert, College of Engineering and Computer Science, ANU | |
local.description.embargo | 2037-12-31 | |
local.bibliographicCitation.startpage | 114 | |
local.bibliographicCitation.lastpage | 121 | |
local.identifier.doi | 10.1109/ICDM.2005.91 | |
dc.date.updated | 2015-12-11T10:34:35Z | |
local.identifier.scopusID | 2-s2.0-33750343311 | |
Collections | ANU Research Publications |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Chen_Making_Subsequence_Time_Series_2005.pdf | 257.42 kB | Adobe PDF | Request a copy |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator