A Multi-measure Nearest Neighbor Algorithm for Time Series Classification

  • Fábio Fabris
  • Idilio Drago
  • Flávio M. Varejão
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5290)


In this paper, we have evaluated some techniques for the time series classification problem. Many distance measures have been proposed as an alternative to the Euclidean Distance in the Nearest Neighbor Classifier. To verify the assumption that the combination of various similarity measures may produce a more accurate classifier, we have proposed an algorithm to combine several measures based on weights. We have carried out a set of experiments to verify the hypothesis that the new algorithm is better than the classical ones. Our results show an improvement over the well-established Nearest-Neighbor with DTW (Dynamic Time Warping), but in general, they were obtained combining few measures in each problem used in the experimental evaluation.


Data Mining Machine Learning Time Series Classification Multi-Measure Classifier 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Antunes, C.M., Oliveira, A.L.: Temporal Data Mining: An Overview. In: Proceedings of the Workshop on Temporal Data Mining, San Francisco, EUA. Knowledge Discovery and Data Mining (KDD 2001) (2001)Google Scholar
  2. 2.
    Savary, L.: Notion of Similarity in (Spatio-)Temporal Data Mining. In: ECAI 2002 Workshop on Knowledge Discovery from (Spatio-)Temporal Data, pp. 63–71 (2002)Google Scholar
  3. 3.
    Keogh, E., Kasetty, S.: On the Need for Time Series Data Mining Benchmarks: A Survey and Empirical Demonstration. Data Mining and Knowledge Discovery 7(4), 349–371 (2003)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Xi, X., Keogh, E., Shelton, C., Wei, L., Ratanamahatana, C.A.: Fast Time Series Classification Using Numerosity Reduction. In: ICML 2006: Proceedings of the 23rd international conference on Machine learning, pp. 1033–1040. ACM Press, New York (2006)CrossRefGoogle Scholar
  5. 5.
    Cover, T., Hart, P.E.: Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory 13(1), 21–27 (1967)zbMATHCrossRefGoogle Scholar
  6. 6.
    Devijver, P.A., Kittler, J.: Pattern Recognition: A Statistical Approach. Prentice Hall, London (1982)zbMATHGoogle Scholar
  7. 7.
    Agrawal, R., Lin, K.I., Sawhney, H.S., Shim, K.: Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases. In: Proceedings of the 21st International Conference on Very Large Data Bases, pp. 490–501 (1995)Google Scholar
  8. 8.
    Levenshtein, V.I.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady 10(8), 707–710 (1966)MathSciNetGoogle Scholar
  9. 9.
    Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)zbMATHGoogle Scholar
  10. 10.
    Hamming, R.W.: Error Detecting and Error Correcting Codes. Bell System Technical Journal 29(2), 147–160 (1950)MathSciNetGoogle Scholar
  11. 11.
    Bozkaya, T., Yazdani, N., Özsoyoglu, M.: Matching and Indexing Sequences of Different Lengths. In: CIKM 1997: Proceedings of the Sixth International Conference on Information and Knowledge Management, pp. 128–135. ACM Press, New York (1997)CrossRefGoogle Scholar
  12. 12.
    Sakoe, H., Chiba, S.: Dynamic Programming Algorithm Optimization for Spoken Word Recognition. IEEE Transactions on Acoustics, Speech, and Signal Processing 26(1), 43–49 (1978)zbMATHCrossRefGoogle Scholar
  13. 13.
    Agrawal, R., Faloutsos, C., Swami, A.: Efficient Similarity Search in Sequence Databases. In: Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms, pp. 69–84 (1993)Google Scholar
  14. 14.
    Daubechies, I.: Ten Lectures on Wavelets. In: CBMS-NSF Reg. Conf. Series in Applied Math. SIAM, Philadelphia (1992)Google Scholar
  15. 15.
    Kohavi, R., Langley, P., Yun, Y.: The Utility of Feature Weighting in Nearest-Neighbor Algorithms. In: 9th European Conference on Machine Learning, Prague, Czech Republic. Springer, Heidelberg (1997)Google Scholar
  16. 16.
    Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. John Wiley and Sons, New York (2001)zbMATHGoogle Scholar
  17. 17.
    Demšar, J.: Statistical Comparisons of Classifiers over Multiple Data Sets. Journal of Machine Learning Research 7(1), 1–30 (2006)Google Scholar
  18. 18.
    Sheskin, D.J.: Handbook of Parametric and Nonparametric Statistical Procedures, 2nd edn. Chapman & Hall/CRC, Boca Raton (2000)zbMATHGoogle Scholar
  19. 19.
    Keogh, E., Xi, X., Wei, L., Ratanamahatana, C.A.: The UCR Time Series Classification/Clustering (2006),
  20. 20.
    Salzberg, S.L.: On Comparing Classifiers: Pitfalls to Avoid and a Recommended Approach. Data Mining and Knowledge Discovery 1(3), 317–328 (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Fábio Fabris
    • 1
  • Idilio Drago
    • 1
  • Flávio M. Varejão
    • 1
  1. 1.Computer Science Department, GoiabeirasFederal University of Espírito SantoVitóriaBrazil

Personalised recommendations