Skip to main content

On the Effective Similarity Measures for the Similarity-Based Pattern Retrieval in Multidimensional Sequence Databases

  • Conference paper
Book cover Fuzzy Systems and Knowledge Discovery (FSKD 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3614))

Included in the following conference series:

  • 904 Accesses

Abstract

In this paper, we propose the effective similarity measures on which the similarity-based pattern retrieval is based. Both data sequences and query sequences are partitioned into segments, and the query processing is based upon the comparison of the features between data and query segments, instead of scanning all data elements of entire sequences. We conduct experiments on multidimensional data sequences that are generated by extracting features from video streams, and show the effectiveness of the proposed measures.

This work was supported by the Korea Research Foundation Grant funded by Korean Government (MOEHRD) (R05-2004-000-10972-0).

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berchtold, S., Keim, D., Kriegel, H.: The X-tree: An Index Structure for High-Dimensional Data. In: Proc. of Int’l Conference on VLDB, pp. 28–39 (1996)

    Google Scholar 

  2. Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. of ACM SIGMOD, pp. 322–331 (1990)

    Google Scholar 

  3. Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of ACM SIGMOD, pp. 47–57 (1984)

    Google Scholar 

  4. 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, pp. 151–162 (2001)

    Google Scholar 

  5. Lee, S.L., Chung, C.W.: Hyper-Rectangle Based Segmentation and Clustering of Large Video Data Sets. Information Science 141(1-2), 139–168 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  6. Rafiei, D.: On Similarity Queries for Time Series Data. In: Proc. of Int’l Conference on Data Engineering, pp. 410–417 (1999)

    Google Scholar 

  7. Rafiei, D., Mendelzon, A.: Similarity-Based Queries for Time Series Data. In: Proc. of ACM SIGMOD, pp. 13–25 (1997)

    Google Scholar 

  8. Sellis, T., Roussopoulos, N., Faloutsos, C.: The R+ Tree: A Dynamic Index for Multi-Dimensional Objects. In: Proc. of Int’l Conference on VLDB, pp. 507–518 (1987)

    Google Scholar 

  9. Yi, B.K., Faloutsos, C.: Fast Time Sequence Indexing for Arbitrary Lp Norms. In: Proc. of Int’l Conference on VLDB, pp. 385–394 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, SL., Lee, JH., Chun, SJ. (2005). On the Effective Similarity Measures for the Similarity-Based Pattern Retrieval in Multidimensional Sequence Databases. In: Wang, L., Jin, Y. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2005. Lecture Notes in Computer Science(), vol 3614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11540007_94

Download citation

  • DOI: https://doi.org/10.1007/11540007_94

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28331-7

  • Online ISBN: 978-3-540-31828-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics