Skip to main content

Toward Measuring the Similarity of Complex Event Sequences in Real-Time

  • Conference paper
Case-Based Reasoning Research and Development (ICCBR 2012)

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

Included in the following conference series:

Abstract

Traditional sequence similarity measures have a high time complexity and are therefore not suitable for real-time systems. In this paper, we analyze and discuss properties of sequences as a step toward developing more efficient similarity measures that can approximate the similarity of traditional sequence similarity measures. To explore our findings, we propose a method for encoding sequence information as a vector in order to exploit the advantageous performance of vector similarity measures. This method is based on the assumption that events closer to a point of interest, like the current time, are more important than those further away. Four experiments are performed on both synthetic and real-time data that show both disadvantages and advantages of the method.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Aamodt, A., Plaza, P.: Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches. AI Communications 7(1), 39–59 (1994)

    Google Scholar 

  2. Adi, A., Etzion, O.: The Situation Manager Rule Language. In: Proceedings of the International Workshop on Rule Markup Languages for Business Rules on the Semantic Web, RuleML (2002)

    Google Scholar 

  3. Catley, C., Stratti, H., McGregor, C.: Multi-Dimensional Temporal Abstraction and Data Mining of Medical Time Series Data: Trends and challenges. In: Engineering in Medicine and Biology Society, pp. 4322–4325 (August 2008)

    Google Scholar 

  4. Chandy, K.M., Schulte, W.R.: Event Processing - Designing IT Systems for Agile Companies. McGraw-Hill (2010)

    Google Scholar 

  5. Gundersen, O.E., Sørmo, F., Aamodt, A., Skalle, P.: A Real-Time Decision Support System for High Cost Oil-Well Drilling Operations. In: Innovative Applications of Artificial Intelligence, IAAI (to appear, 2012)

    Google Scholar 

  6. Kavelar, A., Obweger, H., Schiefer, J., Suntinger, M.: Web-Based Decision Making for Complex Event Processing Systems. In: 6th World Congress on Services, pp. 453–458 (July 2010)

    Google Scholar 

  7. Lamport, L.: Time, Clocks, and the Ordering of Events in a Distributed System. Commun. ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

  8. Levenshtein, V.I.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady 10, 707 (1966)

    MathSciNet  Google Scholar 

  9. Luckham, D.C., Frasca, B.: Complex Event Processing in Distributed Systems. Tech. rep., Stanford University (1998)

    Google Scholar 

  10. Mannila, H., Ronkainen, P.: Similarity of Event Sequences. In: Proceedings of the 4th International Workshop on Temporal Representation and Reasoning. In: TIME. IEEE Computer Society (1997)

    Google Scholar 

  11. Margara, A., Cugola, G.: Processing Flows of Information: From Data Stream to Complex Event Processing. ACM Computing Suveys (to appear, 2012)

    Google Scholar 

  12. Obweger, H., Suntinger, M., Schiefer, J., Raidl, G.: Similarity Searching in Sequences of Complex Events. In: 2010 Fourth International Conference on Research Challenges in Information Science (RCIS), pp. 631–640 (May 2010)

    Google Scholar 

  13. Perrochon, L., Mann, W., Kasriel, S., Luckham, D.C.: Event Mining with Event Processing Networks. In: Zhong, N., Zhou, L. (eds.) PAKDD 1999. LNCS (LNAI), vol. 1574, pp. 474–478. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  14. Stacey, M., McGregor, C., Tracy, M.: An Architecture for Multi-Dimensional Temporal Abstraction and Its Application to Support Neonatal Intensive Care. In: Engineering in Medicine and Biology Society, pp. 3752–3756 (August 2007)

    Google Scholar 

  15. Ukkonen, E.: Algorithms for Approximate String Matching. Information and Control 64(1-3), 100–118 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  16. Wagner, R.A., Fischer, M.J.: The String-to-String Correction Problem. J. ACM 21(1), 168–173 (1974)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gundersen, O.E. (2012). Toward Measuring the Similarity of Complex Event Sequences in Real-Time. In: Agudo, B.D., Watson, I. (eds) Case-Based Reasoning Research and Development. ICCBR 2012. Lecture Notes in Computer Science(), vol 7466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32986-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32986-9_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32985-2

  • Online ISBN: 978-3-642-32986-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics