Piecewise Factorization for Time Series Classification

  • Qinglin Cai
  • Ling Chen
  • Jianling Sun
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 631)


In the research field of time series analysis and mining, the nearest neighbor classifier (1NN) based on the dynamic time warping distance (DTW) is well known for its high accuracy. However, the high computational complexity of DTW can lead to the expensive time consumption of the classifier. An effective solution is to compute DTW in the piecewise approximation space (PA-DTW). However, most of the existing piecewise approximation methods must predefine the segment length and focus on the simple statistical features, which would influence the precision of PA-DTW. To address this problem, we propose a novel piecewise factorization model (PCHA) for time series, where an adaptive segment method is proposed and the Chebyshev coefficients of subsequences are extracted as features. Based on PCHA, the corresponding PA-DTW measure named ChebyDTW is proposed for the 1NN classifier, which can capture the fluctuation information of time series for the similarity measure. The comprehensive experimental evaluation shows that ChebyDTW can support both accurate and fast 1NN classification.


Time series Piecewise approximation Similarity measure 



This work was funded by the Ministry of Industry and Information Technology of China (No. 2010ZX01042-002-003-001), China Knowledge Centre for Engineering Sciences and Technology (No. CKCEST-2014-1-5), and National Natural Science Foundation of China (No. 61332017).


  1. 1.
    Esling, P., Agon, C.: Time-series data mining. ACM Comput. Surv. 45(1), 12 (2012)CrossRefzbMATHGoogle Scholar
  2. 2.
    Fu, T.: A review on time series data mining. Eng. Appl. Artif. Intell. 24(1), 164–181 (2011)CrossRefGoogle Scholar
  3. 3.
    Ding, H., Trajcevski, G., Scheuermann, P., Wang, X., Keogh, E.: Querying and mining of time series data: experimental comparison of representations and distance measures. In: Proceedings of the VLDB Endowment, pp. 1542–1552 (2008)Google Scholar
  4. 4.
    Hills, J., Lines, J., Baranauskas, E., Mapp, J., Bagnall, A.: Classification of time series by shapelet transformation. Data Min. Knowl. Disc. 28(4), 851–881 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Serra, J., Arcos, J.L.: An empirical evaluation of similarity measures for time series classification. Knowl.-Based Syst. 67, 305–314 (2014)CrossRefGoogle Scholar
  6. 6.
    Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Dimensionality reduction for fast similarity search in large time series databases. Knowl. Inf. Syst. 3(3), 263–286 (2001)CrossRefzbMATHGoogle Scholar
  7. 7.
    Keogh, E., Chu, S., Hart, D., Pazzani, M.: Segmenting time series: a survey and novel approach. Data Min. Time Ser. Databases 57, 1–22 (2004)CrossRefGoogle Scholar
  8. 8.
    Chakrabarti, K., Keogh, E., Mehrotra, S., Pazzani, M.: Locally adaptive dimensionality reduction for indexing large time series databases. ACM Trans. Database Syst. 27(2), 188–228 (2002)CrossRefGoogle Scholar
  9. 9.
    Gullo, F., Ponti, G., Tagarelli, A., Greco, S.: A time series representation model for accurate and fast similarity detection. Pattern Recognit. 42(11), 2998–3014 (2009)CrossRefzbMATHGoogle Scholar
  10. 10.
    Keogh, E.J., Pazzani, M.J.: Scaling up dynamic time warping to massive datasets. In: Żytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol. 1704, pp. 1–11. Springer, Heidelberg (1999). doi: 10.1007/978-3-540-48247-5_1 CrossRefGoogle Scholar
  11. 11.
    Li, H., Guo, C.: Piecewise cloud approximation for time series mining. Knowl.-Based Syst. 24(4), 492–500 (2011)CrossRefGoogle Scholar
  12. 12.
    Lin, J., Vlachos, M., Keogh, E., Gunopulos, D., Liu, J., Yu, S., Le, J.: A MPAA-based iterative clustering algorithm augmented by nearest neighbors search for time-series data streams. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 333–342. Springer, Heidelberg (2005). doi: 10.1007/11430919_40 CrossRefGoogle Scholar
  13. 13.
    Rakthanmanon, T., Campana, B., Mueen, A.: Searching and mining trillions of time series subsequences under dynamic time warping. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing (2012)Google Scholar
  14. 14.
    Keogh, E.J., Pazzani, M.J.: Scaling up dynamic time warping for data mining applications. In: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 285–289 (2000)Google Scholar
  15. 15.
    Ullman, S., Poggio, T.: Vision: A Computational Investigation into the Human Representation and Processing of Visual Information. MIT Press, Cambridge (1982)Google Scholar
  16. 16.
    Gao, J., Sultan, H., Hu, J., Tung, W.: Denoising nonlinear time series by adaptive filtering and wavelet shrinkage: a comparison. IEEE Sig. Process. Lett. 17(3), 237–240 (2010)CrossRefGoogle Scholar
  17. 17.
    Keogh, E., Zhu, Q., Hu, B., Hao, Y., Xi, X., Wei, L., Ratanamahatana, C. A.: UCR time series classification/clustering (2011).
  18. 18.
    Cai, Y., Ng, R.: Indexing spatio-temporal trajectories with Chebyshev polynomials. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, pp. 599–610 (2004)Google Scholar
  19. 19.
    Björkman, M., Holmström, K.: Global optimization using the DIRECT algorithm in matlab. Adv. Model. Optim. 1(2), 17–37 (1999)zbMATHGoogle Scholar
  20. 20.
    Batista, G.E., Keogh, E.J., Tataw, O.M., Souza, V.M.: CID: an efficient complexity-invariant distance for time series. Data Min. Knowl. Disc. 28(3), 634–669 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Keogh, E.J., Pazzani, M.J.: Derivative dynamic time warping. In: Proceedings of SDM, pp. 5–7 (2001)Google Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.College of Computer Science and TechnologyZhejiang UniversityHangzhouChina

Personalised recommendations