Skip to main content

Part of the book series: Studies in Computational Intelligence ((SCI,volume 351))

Abstract

We consider the problem of discovering sequential rules between frequent sequences in sequence databases. A sequential rule expresses a relationship of two event series happening one after another. As well as sequential pattern mining, sequential rule mining has broad applications such as the analyses of customer purchases, web log, DNA sequences, and so on. In this paper, for mining sequential rules, we propose two algorithms, MSR_ImpFull and MSR_PreTree. MSR_ImpFull is an improved algorithm of Full (David Lo et al., 2009), and MSR_PreTree is a new algorithm which generates rules from frequent sequences stored in a prefix-tree structure. Both of them mine the complete set of rules but greatly reduce the number of passes over the set of frequent sequences which lead to reduce the runtime. Experimental results show that the proposed algorithms outperform the previous method in all kinds of databases.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Proc. of 11th Int’l Conf. Data Engineering, pp. 3–14 (1995)

    Google Scholar 

  2. Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. In: Proc. of 5th Int’l Conf. Extending Database Technology, pp. 3–17 (1996)

    Google Scholar 

  3. Zaki, M.J.: SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine Learning Journal 42(1/2), 31–60 (2000)

    Article  Google Scholar 

  4. Pei, J., et al.: Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach. IEEE Trans. Knowledge and Data Engineering 16(10), 1424–1440 (2004)

    MathSciNet  Google Scholar 

  5. Ayres, J., Gehrke, J.E., Yiu, T., Flannick, J.: Sequential Pattern Mining using a Bitmap Representaion. In: SIGKDD Conf., pp. 1–7 (2002)

    Google Scholar 

  6. Gouda, K., Hassaan, M., Zaki, M.J.: Prism: A Primal-Encoding Approach for Frequent Sequence Mining. Journal of Computer and System Sciences 76(1), 88–102 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Spiliopoulou, M.: Managing interesting rules in sequence mining. In: Żytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol. 1704, pp. 554–560. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Lo, D., Khoo, S.-C., Liu, C.: Efficient Mining of Recurrent Rules from a Sequence Database. In: Haritsa, J.R., Kotagiri, R., Pudi, V. (eds.) DASFAA 2008. LNCS, vol. 4947, pp. 67–83. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Lo, D., Khoo, S.C., Wong, L.: Non-Redundant Sequential Rules-Theory and Algorithm. Information Systems 34(4-5), 438–453 (2009)

    Article  Google Scholar 

  10. Yan, X., Han, J., Afshar, R.: CloSpan: Mining Closed Sequential Patterns in Large Databases. In: SDM 2003, San Francisco, CA, pp. 166–177 (2003)

    Google Scholar 

  11. Brin, S., Motwani, R., Ullman, J., Tsur, S.: Dynamic Itemset Counting and Implication Rules for Market Basket Data. In: Proc. of the 1997 ACM-SIGMOD Int’l Conf. on the Management of Data, pp. 255–264 (1997)

    Google Scholar 

  12. Berry, M.J., Linoff, G.S.: Data Mining Techniques for Marketing, Sales and Customer Support. John Wiley & Sons, Chichester (1997)

    Google Scholar 

  13. Kohavi, R., Brodley, C., Frasca, B., Mason, L., Zheng, Z.: KDD-Cup 2000 Organizers’ Report: Peeling the Onion. SIGKDD Explorations 2(2), 86–98 (2000)

    Article  Google Scholar 

  14. Baralis, E., Chiusano, S., Dutto, R.: Applying Sequential Rules to Protein Localization Prediction. Computer and Mathematics with Applications 55(5), 867–878 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Van, TT., Vo, B., Le, B. (2011). Mining Sequential Rules Based on Prefix-Tree. In: Nguyen, N.T., Trawiński, B., Jung, J.J. (eds) New Challenges for Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19953-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19953-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19952-3

  • Online ISBN: 978-3-642-19953-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics