Skip to main content

Recognizing and Discovering Complex Events in Sequences

  • Conference paper
  • First Online:
Foundations of Intelligent Systems (ISMIS 2002)

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

Included in the following conference series:

Abstract

Finding complex patterns in long temporal or spatial sequences from real world applications is gaining increasing interest in data mining. However, standard data mining techniques, taken in isolation, seem to be inadequate to cope with such a task. In fact, symbolic approaches show difficulty in dealing with noise, while non-symbolic approaches, such as neural networks and statistics show difficulty in dealing with very long subsequences where relevant episodes may be interleaved with large gaps. The way out we suggest is to integrate the logic approach with non-symbolic methods in a unified paradigm, as it has been already done in other Artificial Intelligence tasks. We propose a framework where a high level knowledge representation is used to incorporate domain specific knowledge, to focus the attention on relevant episodes during the mining process, and flexible matching algorithms developed in the pattern recognition area are used to deal with noisy data. The knowledge extraction process follows a machine learning paradigm combining inductive and deductive learning, where deduction steps can be interleaved with induction steps aimed at augmenting a weak domain theory with knowledge extracted from the data. Our framework is formally characterized and then is experimentally tested on an artificial dataset showing its ability at dealing with noise and with the presence of long gaps between the relevant episodes.

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. C. Anglano, A. Giordana, G. Lobello, L. Saitta, “An experimental Evaluation of Coevolutive Concept Learning, Proceedings of the 15th International Conference on Machine Learning, (Madison, WI, 1998), pp. 19–23.

    Google Scholar 

  2. F. Bergadano and A. Giordana, “Guiding Induction with Domain Theories”, in Machine Learning: An Artificial Intelligence Approach, vol. III, R.S. Michalsky and Y. Kodratoff (Eds.), Morgan Kaufmann, 474–492, 1990.

    Google Scholar 

  3. F. Bergadano, S. Matwin, R.S. Michalski, J. Zhang, “Learning Two-Tiered Descriptions of Flexible Concepts: The POSEIDON System”, Machine Learning, 8(1), 5–44, 1992.

    Google Scholar 

  4. C. Bettini, S. Wang, S. Jajodia, J. Lin, “Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences”, IEEE Trans. on TKDE, 10(2), 222–237, 1998.

    Google Scholar 

  5. L. Console, P. Terenziani, “Efficient processing of queries and assertions about qualitative and quantitative temporal constraints”, Computational Intelligence 15(4), 442–465, November 1999.

    Google Scholar 

  6. E. Davis, “Constraint Propagation with Interval Labels”, Artificial Intelligence 32, 281–331, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  7. R. Dechter, I. Meiri, J. Pearl, “Temporal Constraint Networks”, Artificial Intelligence 49, 61–95, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. Frasconi, M. Gori, M. Maggini, G. Soda, “Representation of Finite State Automata in Recurrent Radial Basis Function Networks”, Machine Learning, 23, 5–32, 1996.

    MATH  Google Scholar 

  9. D. Gussfield, “Algorithms on Strings, Trees, and Sequences”, Cambridge University Press, 1997.

    Google Scholar 

  10. I. Meiri, “Combining Qualitative and Quantitative Constraints in Temporal Reasoning”, Proc. of the National Conference on Artificial Intelligence, pp. 260–267, 1991.

    Google Scholar 

  11. M.J. Pazzani, D. Kibler, “The utility of knowledge in Inductive Learning”, Machine Learning, 9, 57–94, 1992.

    Google Scholar 

  12. L.R. Rabiner, “A tutorial on hidden Markov models and selected applications in speech recognition”, Proc. IEEE, 77(2), 257–286, 1989.

    Article  Google Scholar 

  13. A. Waibel, T. Hanazawa, G. Hinton, K. Shikano, K. Lang, “Phoneme Recognition Using Time-Delay Neural Networks”, IEEE Transactions on acoustics, speech and signal processing, 328–339, March, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giordana, A., Terenziani, P., Botta, M. (2002). Recognizing and Discovering Complex Events in Sequences. In: Hacid, MS., Raś, Z.W., Zighed, D.A., Kodratoff, Y. (eds) Foundations of Intelligent Systems. ISMIS 2002. Lecture Notes in Computer Science(), vol 2366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48050-1_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-48050-1_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48050-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics