Skip to main content

Similarity Pattern Discovery Using Calendar Concept Hierarchy in Time Series Data

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3007))

Abstract

Most existing approaches for similarity search did not consider applying calendar concept hierarchy to search for similar patterns from time series data. In this paper, we present two techniques that capture scale oriented features of time series and provide an analyzing method for the multi-resolution view along the time dimension. Especially, we propose that a similarity search which makes the most of calendar concept hierarchy involves three stages which consist of data cube count based on time concept hierarchy, sequence division by time level and feature vector extraction. Because these feature vectors are inserted into multi-dimensional index, pre-processing step executes only one time at the beginning of the search process without adding considerable computing cost. Finally, we show that the proposed techniques find useful knowledge with low computational complexity and discovered rules can be applied to industrial fields.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goralwalla, I.A., Leontiev, Y., Ozsu, M.T., Szafron, D.: Temporal Granularity for Unanchored Temporal Data. In: Proc. of the 7th International Conference on Information and Knowledge Management, pp.414–423 (1989)

    Google Scholar 

  2. Snodgrass, R., Ahn, I.: Temporal Databases. IEEE Computer 19(9), 35–42 (1986)

    Google Scholar 

  3. Das, G., Lin, K.-I., Mannila, H., Renganathan, G., Smyth, P.: Rule Discovery from Time Series. In: Proc. of the 4th International Conference on Knowledge Discovery and Data Mining (1998)

    Google Scholar 

  4. Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast Subsequence Matching in Time-Series Databases. In: Proc. of the 1994 ACM SIGMOD International Conference on Management of Data (1994)

    Google Scholar 

  5. Lee, J.W., Lee, Y.J., Kim, H.K., Hwang, B., Ryu, K.H.: Discovering Temporal Relation Rules Mining from Interval Data. In: Shafazand, H., Tjoa, A.M. (eds.) EurAsia-ICT 2002. LNCS, vol. 2510, p. 57. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seo, S., Jin, L., Lee, J.W., Ryu, K.H. (2004). Similarity Pattern Discovery Using Calendar Concept Hierarchy in Time Series Data. In: Yu, J.X., Lin, X., Lu, H., Zhang, Y. (eds) Advanced Web Technologies and Applications. APWeb 2004. Lecture Notes in Computer Science, vol 3007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24655-8_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24655-8_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21371-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics