Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing

RSFDGrC 2005: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing pp 202–210Cite as

Efficient Pattern Matching of Multidimensional Sequences

  • Conference paper

  • 1548 Accesses

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

Abstract

We address the problem of the similarity search in large multidimensional sequence databases. Most of previous work focused on similarity matching and retrieval of one-dimensional sequences. However, many new applications such as weather data or music databases need to handle multidimensional sequences. In this paper, we present the efficient search method for finding similar sequences to a given query sequence in multidimensional sequence databases. The proposed method can efficiently reduce the search space and guarantees no false dismissals. We give preliminary experimental results to show the effectiveness of the proposed method.

This work is supported by the Korea Research Foundation Grant (KRF-2004-005-D00198).

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

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. Agrawal, R., Imielinski, T., Swami, A.N.: Database Mining: A Performance Perspective. IEEE Transactions on Knowledge and Data Engineering 5(6), 914–925 (1993)

    Article  Google Scholar 

  2. Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P.: Knowledge Discovery and Data Mining: Towards a Unifying Framework. In: Proceedings of International Conference on Knowledge Discovery and Data Mining, pp. 82–88 (1996)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  7. Faloutsos, C., Lin, K.I.: Fastmap: A Fast Algorithm for Indexing, Data-mining and Visualization of Traditional and Multimedia Datasets. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 163–174 (1995)

    Google Scholar 

  8. Goldin, D.Q., Kanellakis, P.C.: On Similarity Queries for Time-Series Data: Constraint Specification and Implementation. In: Proceedings of International Conference on Constraint Programming, pp. 137–153 (1995)

    Google Scholar 

  9. Das, G., Gunopulos, D., Mannila, H.: Finding Similar Time Series. In: Proceedings of European Conference on Principles of Data Mining and Knowledge Discovery, pp. 88–100 (1997)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  13. Lam, S.K., Wong, M.H.: A Fast Projection Algorithm for Sequence Data Searching. Data and Knowledge Engineering 28(3), 321–339 (1998)

    Article  MATH  Google Scholar 

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

    Google Scholar 

  15. Rafiei, D.: On Similarity-Based Queries for Time Series Data. In: Proceedings of International Conference on Data Engineering, pp. 410–417 (1999)

    Google Scholar 

  16. Chan, K.P., Fu, A.W.: Efficient Time Series Matching by Wavelets. In: Proceedings International Conference on Data Engineering, pp. 126–133 (1999)

    Google Scholar 

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

    Google Scholar 

  18. Perng, C.S., Wang, H., Zhang, S.R., Parker, D.S.: Landmarks: a New Model for Similarity-based Pattern Querying in Time Series Databases. In: Proceedings of International Conference on Data Engineering, pp. 33–42 (2000)

    Google Scholar 

  19. Kim, S.W., Park, S., Chu, W.W.: An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases. In: Proceedings of International Conference on Data Engineering, pp. 607–614 (2001)

    Google Scholar 

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

    Google Scholar 

  21. Keogh, E.J.: Exact Indexing of Dynamic Time Warping. In: Proceedings of International Conference on Very Large Data Bases, pp. 406–417 (2002)

    Google Scholar 

  22. Popivanov, I., Miller, R.J.: Similarity Search Over Time-Series Uisng Wavelets. In: Proceedings of International Conference on Data Engineering, pp. 212–221 (2002)

    Google Scholar 

  23. Lee, S.L., Chun, S.J., Kim, D.H., Lee, J.H., Chung, C.W.: Similarity Search for Multidimensional Data Sequences. In: Proceedings of International Conference on Data Engineering, pp. 599–608 (2000)

    Google Scholar 

  24. Vlachos, M., Kollios, G., Gunopulos, D.: Discovering Similar Multidimensional Trajectories. In: Proceedings of International Conference on Data Engineering, pp. 673–684 (2002)

    Google Scholar 

  25. Kahveci, T., Singh, A., Gurel, A.: Similairty Searching for Multi-attribute Sequences. In: Proceedings of International Conference on Scientific and Statistical Database Management, pp. 175–184 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Soongsil University,  

    Sangjun Lee & Kyoungsu Oh

  2. Seoul National University,  

    Dongseop Kwon

  3. Thinkware Systems Corporation,  

    Wonik Choi

  4. Kwangwoon University,  

    Jiman Hong

  5. Dankook University,  

    Jongmoo Choi

  6. University of Seoul,  

    Donghee Lee

Authors
  1. Sangjun Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kyoungsu Oh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dongseop Kwon
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wonik Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jiman Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jongmoo Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Donghee Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Regina, Regina, SK, S4S 0A2 Canada, Polish-Japanese Institute of Information Technology, Koszykowa 86, 02-008 Warsaw, P.O. Box, Poland

    Dominik Ślęzak

  2. Department of Computer Science, University of Regina, S4S 0A2, Regina, Saskatchewan, Canada

    JingTao Yao  & Wojciech Ziarko  & 

  3. Department of Electrical and Computer Engineering, University of Manitoba, R3T 5V6, Winnipeg, Manitoba, Canada

    James F. Peters

  4. College of Computer and Information Engineering, Hehan University, Henan, China

    Xiaohua Hu

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, S. et al. (2005). Efficient Pattern Matching of Multidimensional Sequences. In: Ślęzak, D., Yao, J., Peters, J.F., Ziarko, W., Hu, X. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548706_22

Download citation

  • DOI: https://doi.org/10.1007/11548706_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28660-8

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation