Skip to main content

Discovering Sequential Association Rules with Constraints and Time Lags in Multiple 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

We present MOWCATL, an efficient method for mining frequent sequential association rules from multiple sequential data sets with a time lag between the occurrence of an antecedent sequence and the corresponding consequent sequence. This approach finds patterns in one or more sequences that precede the occurrence of patterns in other sequences, with respect to user-specified constraints. In addition to the traditional frequency and support constraints in sequential data mining, this approach uses separate antecedent and consequent inclusion constraints. Moreover, separate antecedent and consequent maximum window widths are used to specify the antecedent and consequent patterns that are separated by the maximum time lag.

We use multiple time series drought risk management data to show that our approach can be effectively employed in real-life problems. The experimental results validate the superior performance of our method for efficiently finding relationships between global climatic episodes and local drought conditions. We also compare our new approach to existing methods and show how they complement each other to discover associations in a drought risk management decision support system.

This research was supported in part by NSF Digital Government Grant No. EIA-0091530 and NSF EPSCOR, Grant No. EPS-0091900.

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. Bettini, C., Wang, X.S., Jajodia, S.: Discovering frequent event patterns with multiple granularities in time sequences. IEEE Transactions on Knowledge and Data Engineering 10 (1998) 222–237

    Article  Google Scholar 

  2. Das, G., Lin, K.I., Mannila, H., Ranganathan, G., Smyth, P.: Rule discovery from time series. In: Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining [KDD 98], New York, NY (1998) 16–22

    Google Scholar 

  3. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Technical report, Department of Computer Science, University of Helsinki, Finland (1997) Report C-1997-15.

    Google Scholar 

  4. Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining [KDD97]. (1997) 67–73

    Google Scholar 

  5. Zaki, M.: Sequence mining in categorical domains: Incorporating constraints. In: Proceedings of the Ninth International Conference on Information and Knowledge Management [CIKM2000], Washington D.C., USA (2000) 422–429

    Google Scholar 

  6. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovering frequent episodes in sequences. In: Proceedings of the First International Conference on Knowledge Discovery and Data Mining [KDD 95], Montreal, Canada (1995) 210–215

    Google Scholar 

  7. McGee, T.B., Doeskin, N.J., Kliest, J.: Drought monitoring with multiple time scales. In: Proceedings of the 9th Conference on Applied Climatology, Boston, MA (1995) 233–236 American Meteorological Society.

    Google Scholar 

  8. Harms, S.K., Deogun, J., Saquer, J., Tadesse, T.: Discovering representative episodal association rules from event sequences using frequent closed episode sets and event constraints. In: Proceedings of the 2001 IEEE International Conference on Data Mining, San Jose, California, USA (2001) 603–606

    Google Scholar 

  9. Kryszkiewicz, M.: Fast discovery of representative association rules. In: Lecture Notes in Artificial Intelligence. Volume 1424., Proceedings of RSCTC 98, Springer-Verlag (1998) 214–221

    Google Scholar 

  10. Harms, S.K., Goddard, S., Reichenbach, S.E., Waltman, W.J., Tadesse, T.: Data mining in a geospatial decision support system for drought risk management. In: Proceedings of the 2001 National Conference on Digital Government Research, Los Angelos, California, USA (2001) 9–16

    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

Harms, S.K., Deogun, J., Tadesse, T. (2002). Discovering Sequential Association Rules with Constraints and Time Lags in Multiple 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_47

Download citation

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

  • 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