Skip to main content

Discovering unexpected patterns in temporal data using temporal logic

  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1399))

Abstract

There has been much attention given recently to the task of finding interesting patterns in temporal databases. Since there are so many different approaches to the problem of discovering temporal patterns, we first present a characterization of different discovery tasks and then focus on one task of discovering interesting patterns of events in temporal sequences. Given an (infinite) temporal database or a sequence of events one can, in general, discover an infinite number of temporal patterns in this data. Therefore, it is important to specify some measure of interestingness for discovered patterns and then select only the patterns interesting according to this measure. We present a probabilistic measure of interestingness based on unexpectedness, whereby a pattern P is deemed interesting if the ratio of the actual number of occurrences of P exceeds the expected number of occurrences of P by some user defined threshold. We then make use of a subset of the propositional, linear temporal logic and present an efficient algorithm that discovers unexpected patterns in temporal data. Finally, we apply this algorithm to synthetic data, UNIX operating system calls, and Web logfiles and present the results of these experiments.

This work was supported in part by the NSF under Grant IRI-93-18773.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In In Proc. of the conference on foundations of data organizations and algorithms (FODO), October 1993.

    Google Scholar 

  2. R. Agrawal, T. Imielinsky, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD Conference, pages 207–216, 1993.

    Google Scholar 

  3. R. Agrawal, K-I Lin, H.S. Sawhney, and K. Shim. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In In Proc. of the 21st VLDB conference., 1995.

    Google Scholar 

  4. R. Agrawal, G. Psaila, E. Wimmers, and M. Zait. Querying shapes of histories. In In Proc. of the 21st VLDB conference., 1995.

    Google Scholar 

  5. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. of the International Conference on Data Engineering., March 1995.

    Google Scholar 

  6. W.A. Ainsworth. Speech recognition by machine. Peter Peregrinus Ltd., London, 1998.

    Google Scholar 

  7. D. Berndt. AX: Searching for database regularities using concept networks. In Proceedings of the WITS Conference., 1995.

    Google Scholar 

  8. D. J. Berndt and J. Clifford. Finding patterns in time series: A dynamic programming approach. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining. AAAI Press/ The MIT Press, 1996.

    Google Scholar 

  9. C. Bettini, X.S. Wang, and S. Jajodia. Testing complex temporal relationships involving multiple granularities and its application to data mining. In Proceedings of PODS Symposium, 1996.

    Google Scholar 

  10. J. Clifford, V. Dhar, and A. Tuzhilin. Knowledge discovery from databases: The NYU project. Technical Report IS-95-12, Stern School of Business, New York University, December 1995.

    Google Scholar 

  11. V. Dhar and A. Tuzhilin. Abstract-driven pattern discovery in databases. IEEE Transactions on Knowledge and Data Engineering, 5(6), 1993.

    Google Scholar 

  12. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In In Proceedings of the SIGMOD conference., 1994.

    Google Scholar 

  13. D.Q. Goldin and P.C. Kanellakis. On similarity queries for time-series data: constraint specification and implementation. In In Proc. of the 1st Int'l Conference on the Principles and Practice of Constraint Programming. LNCS 976, September 1995.

    Google Scholar 

  14. P. Laird. Identifying and using patterns in sequential data. In Algorithmic Learning Theory, 4th International Workshop, Berlin, 1993.

    Google Scholar 

  15. J.B. Little and L. Rhodes. Understanding Wall Street. Liberty Publishing Company, Cockeysville, Maryland, 1978.

    Google Scholar 

  16. H. Mannila and H. Toivonen. Discovering generalized episodes using minimal occurrences. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, August 1996.

    Google Scholar 

  17. H. Mannila, H. Toivonen, and A. Verkamo. Discovering frequent episodes in sequences. In Proceedings of the First International Conference on Knowledge Discovery and Data Mining, Montreal,Canada, August 1995.

    Google Scholar 

  18. B. Padmanabhan and A. Tuzhilin. Pattern discovery in temporal databases: A temporal logic approach. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, August 1996.

    Google Scholar 

  19. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.

    Google Scholar 

  20. H.V. Poor. An Introduction to signal detection and estimation. Springer-Verlag, New York, 1988.

    Google Scholar 

  21. L.R. Rabiner and S.E. Levinson. Isolated and connected word recognition: Theory and selected applications. In Readings in speech recognition. Morgan Kaufmann Publishers, San Mateo, CA., 1990.

    Google Scholar 

  22. P. Seshadri, M. Livny, and R. Ramakrishnan. Design and implementation of sequence database system. In Proceedings of ACM SIGMOD Conference, 1996.

    Google Scholar 

  23. A. Silberschatz and A. Tuzhilin. On subjective measures of interestingness in knowledge discovery. In Proceedings of the First International Conference on Knowledge Discovery and Data Mining, Montreal, Canada, August 1995.

    Google Scholar 

  24. A. Silberschatz and A. Tuzhilin. What makes patterns interesting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineering, 8(6), December 1996.

    Google Scholar 

  25. R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In Proceedings of the International Conference on Extending Database Technology, 1996.

    Google Scholar 

  26. J. van Leeuwen. Handbook of Theoretical Computer Science: Volume B Formal Models and Semantics. The MIT Press/Elsevier, 1990.

    Google Scholar 

  27. J. T.-L. Wang, G.-W. Chirn, T. G. Marr, B. Shapiro, D. Shasha, and K. Zhang. Combinatorial pattern discovery for scientific data: Some preliminary results. In Proceedings of ACM SIGMOD Conference on Management of Data, 1994.

    Google Scholar 

  28. L. Zadeh. The role of fuzzy logic in the management of uncertainty in expert systems. In Fuzzy Sets and Systems, vol. 11, pages 199–227. 1983.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Opher Etzion Sushil Jajodia Suryanarayana Sripada

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Berger, G., Tuzhilin, A. (1998). Discovering unexpected patterns in temporal data using temporal logic. In: Etzion, O., Jajodia, S., Sripada, S. (eds) Temporal Databases: Research and Practice. Lecture Notes in Computer Science, vol 1399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053707

Download citation

  • DOI: https://doi.org/10.1007/BFb0053707

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64519-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics