Skip to main content

Event Mining with Event Processing Networks

  • Conference paper
  • First Online:
Methodologies for Knowledge Discovery and Data Mining (PAKDD 1999)

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

Included in the following conference series:

Abstract

Event Mining discovers information in a stream of data, or events, and delivers knowledge in real-time. Our event processing engine consists of a network of event processing agents (EPAs) running in parallel that interact using a dedicated event processing infrastructure. EPAs can be configured at run-time using a formal pattern language. The underlying infrastructure provides an abstract communication mechanism and thus allows dynamic reconfiguration of the communication topology between agents at run-time and provides transparent, location-independent access to all data. These features support dynamic allocation of EPAs to machines in a local area network at run time.

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. Pratt, V. R. Modeling concurrency with partial orders. Int. J. of Parallel Programming, 1986. 15(1): p. 33–71.

    Article  MATH  MathSciNet  Google Scholar 

  2. RAPIDE, Rapide 1.0 Pattern Language Reference Manual. Stanford University, Stanford, 1997.

    Google Scholar 

  3. Luckham, D. C. and Frasca, B., Complex Event Processing in Distributed Systems. Computer Systems Laboratory Technical Report CSL-TR-98-754. Stanford University, Stanford, 1998.

    Google Scholar 

  4. Santoro, A., et al., eJava–Extending Java with Causality. In Proceedings of 10th International Conference on Software Engineering and Knowledge Engineering (SEKE’98). 1998. Redwood City, CA, USA.

    Google Scholar 

  5. Fidge, C. J., Timestamps in message-passing systems that preserve the partial ordering. Australian Computer Science Communications, 1988. 10(1): p. 55–66.

    Google Scholar 

  6. Wolfson, O., et al., Incremental Evaluation of Rules and its Relationship to Parallelism. In Proceedings of SIGMOD’91 Conference on the Management of Data. 1991. Boulder, CO: ACM Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perrochon, L., Mann, W., Kasriel, S., Luckham, D.C. (1999). Event Mining with Event Processing Networks. In: Zhong, N., Zhou, L. (eds) Methodologies for Knowledge Discovery and Data Mining. PAKDD 1999. Lecture Notes in Computer Science(), vol 1574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48912-6_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-48912-6_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65866-5

  • Online ISBN: 978-3-540-48912-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics