Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 572124, 12 pages
http://dx.doi.org/10.1155/2014/572124
Research Article

Generalized Framework for Similarity Measure of Time Series

1China University of Mining and Technology, Xuzhou 221116, China
2University of Chinese Academy of Sciences, Beijing 100049, China
3Institute of Electrical Engineering, Chinese Academy of Sciences, Beijing 100190, China
4Synopsys Inc., Mountain View, CA 94043, USA
5Portland State University, Portland, OR 97207, USA

Received 9 July 2014; Revised 10 October 2014; Accepted 13 October 2014; Published 3 November 2014

Academic Editor: Yan Liang

Copyright © 2014 Hongsheng Yin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos, “Fast Subsequence matching in time-series databases,” in Proceedings of the ACM International Conference on Management of Data, vol. 23, pp. 419–429, 1994.
  2. R. Agrawal, C. Faloutsos, and A. Swami, “Efficient similarity search in sequence databases,” in Proceedings of the International Conference on Foundations of Data Organization and Algorithms, pp. 69–84, Chicago, Ill, USA, 1993.
  3. D. J. Berndt and J. Clifford, “Using dynamic time warping to find patterns in time series,” Knowledge Discovery and Data Mining Workshop, vol. 10, no. 16, pp. 359–370, 1994. View at Google Scholar
  4. E. Keogh and C. A. Ratanamahatana, “Exact indexing of dynamic time warping,” Knowledge and Information Systems, vol. 7, no. 3, pp. 358–386, 2005. View at Publisher · View at Google Scholar · View at Scopus
  5. D. J. Berndt and J. Clifford, “Finding patterns in time series: a dynamic programming approach,” in Advances in Knowledge Discovery and Data Mining, pp. 229–248, American Association for Artificial Intelligence, Menlo Park, Calif, USA, 1996. View at Google Scholar
  6. M. Vlachos, G. Kollios, and D. Gunopulos, “Discovering similar multidimensional trajectories,” in Proceedings of the 18th International Conference on Data Engineering, pp. 673–684, San Jose, Calif, USA, March 2002. View at Scopus
  7. L. Chen, M. T. Ozsu, and V. Oria, “Robust and fast similarity search for moving object trajectories,” in Proceedings of the ACM International Conference on Management of Data (SIGMOD '05), pp. 491–502, Baltimore, Md, USA, 2005. View at Publisher · View at Google Scholar
  8. L. Chen and R. T. Ng, “On the marriage of Lp-norms and edit distance,” in Proceedings of the 30th International Conference on Very Large Data Bases, vol. 30, pp. 792–803, Toronto, Canada, 2004.
  9. Y. Chen, M. A. Nascimento, B. C. Ooi, and A. K. H. Tung, “SpADe: on shape-based pattern detection in streaming time series,” in Proceedings of the 23rd International Conference on Data Engineering (ICDE '07), pp. 786–795, Istanbul, Turkey, April 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. E. Frentzos, K. Gratsias, and Y. Theodoridis, “Index-based most similar trajectory search,” in Proceedings of the 23rd International Conference on Data Engineering (ICDE '07), pp. 816–825, Istanbul, Turkey, April 2007. View at Publisher · View at Google Scholar · View at Scopus
  11. M. D. Morse and J. M. Patel, “An efficient and accurate method for evaluating time series similarity,” in Proceedings of the ACM International Conference on Management of Data, pp. 569–580, 2007.
  12. J. Aßfalg, H.-P. Kriegel, P. Kröger, P. Kunath, A. Pryakhin, and R. Renz, “Similarity search on time series based on threshold queries,” in Advances in Database Technology—EDBT 2006, vol. 3896 of Lecture Notes in Computer Science, pp. 276–294, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  13. K. Yang and C. Shahabi, “A PCA-based similarity measure for multivariate time series,” in Proceedings of the 2nd ACM International Workshop on Multimedia Databases (MMDB '04), pp. 65–74, Washington, D.C., USA, November 2004. View at Scopus
  14. K. Yang and C. Shahabi, “An efficient k nearest neighbor search for multivariate time series,” Information and Computation, vol. 205, no. 1, pp. 65–98, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. J.-W. Xu, A. R. Paiva, I. Park, and J. C. Principe, “A reproducing kernel Hilbert space framework for information-theoretic learning,” IEEE Transactions on Signal Processing, vol. 56, no. 12, pp. 5891–5902, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. J.-W. Xu, P. P. Pokharel, A. R. C. Paiva, and J. C. Príncipe, “Nonlinear component analysis based on correntropy,” in Proceedings of the International Joint Conference on Neural Networks (IJCNN '06), pp. 1851–1855, Vancouver, Canada, July 2006. View at Scopus
  17. S. Liu and H. Jiang, “Study of the conception of the similarity in time series,” Journal of Huazhong University of Science and Technology, vol. 32, no. 7, pp. 75–79, 2004 (Chinese). View at Google Scholar · View at Scopus
  18. The UCR Time Series Data Mining Archive, http://www.cs.ucr.edu/~eamonn/time_series_data/dataset.zip.
  19. UCI Machine Learning Repository, http://archive.ics.uci.edu/ml/.
  20. N. Saito, “Local feature extraction and its application us ing a library of bases,” in Topics in Analysis and Its Applications: Selected Theses, pp. 265–451, 2000. View at Google Scholar
  21. S. Manganaris, Supervised classiffication with temporal data [Ph.D. thesis], Computer Science Department, School of Engineering, Vanderbilt University, 1997.
  22. M. W. Kadous, “Learning comprehensible descriptions of multivariate time series,” in Proceedings of the 16th International Machine Learning Conference, pp. 454–463, Morgan Kaufmann, 1999.
  23. J. J. R. Diez and C. A. Gonzalez, “Applying boosting to similarity literals for time series classiffication,” in Proceedings of the 1st International Workshop on Multiple Classifier Systems, pp. 210–219, 2000.