Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4681))

Included in the following conference series:

Abstract

In this paper, we propose the novel feature extraction method, called the Polar wavelet, which can improve the search performance for locally distributed time series data. Among various feature extraction methods, the Harr wavelet has been popularly used to extract features from time series data. However, the Harr wavelet does not show the good performance for sequences of similar averages. The proposed method uses polar coordinates which are not affected by averages and can reduce the search space efficiently without false dismissals. The experiments are performed on real temperature dataset to verify the performance of the proposed method.

This work was supported by the Brain Korea 21 Project in 2007.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of ACM SIGMOD International Conference on Management of Data, pp. 47–57. ACM Press, New York (1984)

    Google Scholar 

  2. Agrawal, R., Faloutsos, C., Swami, A.N.: Efficient Similarity Search In Sequence Databases. In: Proc. of International Conference on Foundations of Data Organization and Algorithms, pp. 69–84 (1993)

    Google Scholar 

  3. Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast Subsequence Matching in Time-Series Databases. In: Proc. of ACM SIGMOD International Conference on Management of Data, pp. 419–429. ACM Press, New York (1994)

    Chapter  Google Scholar 

  4. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. of ACM SIGMOD International Conference on Management of Data, pp. 322–331. ACM Press, New York (1990)

    Google Scholar 

  5. Chu, K.K.W., Wong, M.H.: Fast Time-Series Searching with Scaling and Shifting. In: Proc. of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 237–248. ACM Press, New York (1999)

    Google Scholar 

  6. 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: Proc. of International Conference on Very Large Data Bases, pp. 490–501 (1995)

    Google Scholar 

  7. Yi, B.-K., Jagadish, H.V., Faloutsos, C.: Efficient Retrieval of Similar Time Sequences Under Time Warping. In: Proc. of International Conference on Data Engineering, pp. 201-208 (1998)

    Google Scholar 

  8. Korn, F., Jagadish, H.V., Faloutsos, C.: Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences. In: Proc. of SIGMOD Conference on Management of Data, pp. 289-300 (1997)

    Google Scholar 

  9. Chan, K.-p., Fu, A.W.-c.: Efficient Time Series Matching by Wavelets. In: Proc. of International Conference on Data Engineering, pp. 126-133 (1999)

    Google Scholar 

  10. Keogh, E.J., Chakrabarti, K., Mehrotra, S., Pazzani, M.J.: Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases. In: Proc. of ACM SIGMOD International Conference on Management of Data, pp. 151-162 (2001)

    Google Scholar 

  11. Yi, B.-K., Faloutsos, C.: Fast Time Sequence Indexing for Arbitrary Lp Norms. In: Proc. of International Conference on Very Large Data Bases, pp. 385-394 (2000)

    Google Scholar 

  12. Hellerstein, J.M., Koutsoupias, E., Papadimitriou, C.H.: On the Analysis of Indexing Schemes. In: Proc. of ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 249-256 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

De-Shuang Huang Laurent Heutte Marco Loog

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Kang, S., Kim, J., Chae, J., Choi, W., Lee, S. (2007). Similarity Search Using the Polar Wavelet in Time Series Databases. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues. ICIC 2007. Lecture Notes in Computer Science, vol 4681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74171-8_137

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74171-8_137

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74170-1

  • Online ISBN: 978-3-540-74171-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics