|
ABSTRACT
Many algorithms have been proposed for the problem of time series classification. However, it is clear that one-nearest-neighbor with Dynamic Time Warping (DTW) distance is exceptionally difficult to beat. This approach has one weakness, however; it is computationally too demanding for many realtime applications. One way to mitigate this problem is to speed up the DTW calculations. Nonetheless, there is a limit to how much this can help. In this work, we propose an additional technique, numerosity reduction, to speed up one-nearest-neighbor DTW. While the idea of numerosity reduction for nearest-neighbor classifiers has a long history, we show here that we can leverage off an original observation about the relationship between dataset size and DTW constraints to produce an extremely compact dataset with little or no loss in accuracy. We test our ideas with a comprehensive set of experiments, and show that it can efficiently produce extremely fast accurate classifiers.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Chen, L. & Kamel, M. S. (2005). Design of Multiple Classifier Systems for Time Series Data. Multiple Classifier Systems, pp. 216--225.
|
| |
2
|
|
| |
3
|
Dasarathy, B. V. (1991). Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, pp. 388--397.
|
| |
4
|
Eads, D., Glocer, K., Perkins, S., & Theiler, J. (2005). Grammar-guided feature extraction for time series classification. NIPS '05.
|
| |
5
|
|
| |
6
|
Geurts, P. (2002). Contributions to decision tree induction: bias/variance tradeoff and time series classification. Ph.D. thesis, University of Liege.
|
 |
7
|
|
| |
8
|
|
| |
9
|
Hayashi, A., Mizuhara, Y., & Suematsu, N. (2005). Embedding Time Series Data for Classification. Machine Learning and Data Mining in Pattern Recognition, pp. 356--365.
|
| |
10
|
Karydis, I., Nanopoulos, A., Papadopoulos, A., & Manolopoulos, Y. (2005). Music Retrieval in P2P Networks Under the Warping Distance, 7th International Conference on Enterprise Information Systems.
|
| |
11
|
Keogh, E. (2002). Exact Indexing of Dynamic Time Warping. VLDB '02, pp. 406--417, Hong Kong, Aug 20--23.
|
| |
12
|
Keogh, E. (2006). UCR Time Series Archive www.cs.ucr.edu/~eamonn/TSDMA/
|
| |
13
|
Kim, S., Smyth, P., & Luther, S. (2004). Modeling waveform shapes with random effects segmental hidden Markov Models. Technical Report, UCI-ICS 04--05.
|
| |
14
|
|
| |
15
|
|
| |
16
|
Megalooikonomou, V. (2006). Personal Communication.
|
| |
17
|
|
| |
18
|
Pekalska, E., Duin, R. P. W., & Paclik, P. (2006). Prototype Selection for Dissimilarity-Based Classifiers. Pattern Recognition, 39:2, pp. 189--208.
|
| |
19
|
Ratanamahatana, C. A. & Keogh, E. (2005). Three myths about Dynamic Time Warping Data Mining. SDM '05.
|
 |
20
|
|
| |
21
|
|
| |
22
|
Sakoe, H. & Chiba, S. Dynamic programming algorithm optimization for spoken word recognition. (1978). IEEE Trans. Acoustics, Speech, and Signal Proc., Vol. ASSP-26.
|
| |
23
|
|
| |
24
|
|
| |
25
|
|
 |
26
|
|
| |
27
|
Zhu, Y. & Shasha, D. (2003). Query by Humming: a Time Series Database Approach, SIGMOD '03.
|
|