Skip to main content

PROWL: An Efficient Frequent Continuity Mining Algorithm on Event Sequences

  • Conference paper
Data Warehousing and Knowledge Discovery (DaWaK 2004)

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

Included in the following conference series:

Abstract

Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction association, which consider only relationship among the item in the same transaction. However, intra-transaction association rules are not a suitable for trend prediction. Therefore, inter-transaction association is introduced, which consider the relationship among itemset of multiple time instants. In this paper, we present PROWL, an efficient algorithm for mining inter-transaction rules. By using projected window method and depth first enumeration approach, we can discover all frequent patterns quickly. Finally, an extensive experimental evaluation on a number of real and synthetic database shows that PROWL significantly outperforms previous method.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Huang, K.Y., Chang, C.H.: Asynchronous periodic patterns mining in temporal databases. In: Proc. of the IASTED International Conference on Databases and Applications (DBA), pp. 43–48 (2004)

    Google Scholar 

  2. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovering frequent episodes in sequences. In: Proc. of the First International Conference on Knowledge Discovery and Data Mining, pp. 210–215 (1995)

    Google Scholar 

  3. Tung, K.H., Han, J., Lu, H., Feng, L.: Breaking the barrier of transactions: Mining inter-transaction association rules. In: Proc. of the International Conference on Knowledge Discovery and Data Mining, pp. 297–301 (1999)

    Google Scholar 

  4. Tung, K.H., Han, J., Lu, H., Feng, L.: Efficient mining of intertransaction association rules. IEEE Transactions on Knowledge and Data Engineering 15(1), 43–56 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, KY., Chang, CH., Lin, KZ. (2004). PROWL: An Efficient Frequent Continuity Mining Algorithm on Event Sequences. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2004. Lecture Notes in Computer Science, vol 3181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30076-2_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30076-2_35

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics