On Clustering Multimedia Time Series Data Using K-Means and Dynamic Time Warping

Authors:
Vit Niennattrakul;Chotirat Ann Ratanamahatana
Affiliations:
Chulalongkorn University;Chulalongkorn University
Venue:
MUE '07 Proceedings of the 2007 International Conference on Multimedia and Ubiquitous Engineering
Year:
2007

Citing 0
Cited 5

Assessment of error in air quality models using dynamic time warping

Proceedings of the 1st ACM SIGSPATIAL International Workshop on Data Mining for Geoinformatics
A global averaging method for dynamic time warping, with applications to clustering

Pattern Recognition
Weighted dynamic time warping for time series classification

Pattern Recognition
A dynamic unsupervised laterally connected neural network architecture for integrative pattern discovery

ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Shape-Based clustering for time series data

PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

After the generation of multimedia data turned digital, an explosion of interest in their data storage, retrieval, and processing has drastically increased. This includes videos, images, and audios, where we now have higher expectations in exploiting these data at hands. Typical manipulations are in some forms of video/image/audio processing, including automatic speech recognition, which require fairly large amount of storage and are computationally intensive. In our recent work, we have demonstrated the utility of time series representation in the task of clustering multimedia data using k-medoids method, which allows considerable amount of reduction in computational effort and storage space. However, kmeans is a much more generic clustering method when Euclidean distance is used. In this work, we will demonstrate that unfortunately, k-means clustering will sometimes fail to give correct results, an unaware fact that may be overlooked by many researchers. This is especially the case when Dynamic Time Warping (DTW) is used as the distance measure in averaging the shape of time series. We also will demonstrate that the current averaging algorithm may not produce the real average of the time series, thus generates incorrect k-means clustering results, and then show potential causes why DTW averaging methods may not achieve meaningful clustering results. Lastly, we conclude with a suggestion of a method to potentially find the shape-based time series average that satisfies the required properties.