Skip to main content

Mining Sequential Patterns with Negative Conclusions

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5182))

Abstract

The new type of patterns: sequential patterns with the negative conclusions is proposed in the paper. They denote that a certain set of items does not occur after a regular frequent sequence. Some experimental results and the SPAWN algorithm for mining sequential patterns with the negative conclusions are also presented.

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

Buying options

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

Learn about 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: The Eleventh International Conference on Data Engineering ICDE, pp. 3–14. IEEE Computer Society, Los Alamitos (1995)

    Chapter  Google Scholar 

  2. Antonie, M.-L., Zaïane, O.R.: Mining Positive and Negative Association Rules: An Approach for Confined Rules. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 27–38. Springer, Heidelberg (2004)

    Google Scholar 

  3. Ayres, J., Gehrke, J.E., Yiu, T., Flannick, J.: Sequential Pattern Mining Using Bitmaps. In: KDD 2002, pp. 429–435. ACM Press, New York (2002)

    Chapter  Google Scholar 

  4. Chang, L., Yang, D., Tang, S., Wang, T.: Mining Compressed Sequential Patterns. In: Li, X., Zaïane, O.R., Li, Z. (eds.) ADMA 2006. LNCS (LNAI), vol. 4093, pp. 761–768. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Chen, Y., Guo, J., Wang, Y., Xiong, Y., Zhu, Y.: Incremental Mining of Sequential Patterns Using Prefix Tree. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 433–440. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Cheng, H., Yan, X., Han, J.: IncSpan: incremental mining of sequential patterns in large database. In: KDD 2004, pp. 527–532. ACM Press, New York (2004)

    Chapter  Google Scholar 

  7. Cong, S., Han, J., Padua, D.A.: Parallel mining of closed sequential patterns. In: KDD, pp. 562–567. ACM Press, New York (2005)

    Google Scholar 

  8. Cornelis, C., Yan, P., Zhang, X., Chen, G.: Mining Positive and Negative Association Rules from Large Databases. In: 2006 IEEE Conf. on Cybernetics & Intelligent Sys., pp. 613–618 (2006)

    Google Scholar 

  9. García-Hernández, R.A., Trinidad, J.F.M., Carrasco-Ochoa, J.A.: A New Algorithm for Fast Discovery of Maximal Sequential Patterns in a Document Collection. In: Gelbukh, A. (ed.) CICLing 2006. LNCS, vol. 3878, pp. 514–523. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Kazienko, P.: Filtering of Web Recommendation Lists Using Positive and Negative Usage Patterns. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part III. LNCS (LNAI), vol. 4694, pp. 1016–1023. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Kazienko, P.: Usage-Based Positive and Negative Verification of User Interface Structure. In: ICAS 2008, pp. 1–6. IEEE Computer Society, Los Alamitos (2008)

    Google Scholar 

  12. Li, H., Chen, H.: GraSeq: A Novel Approximate Mining Approach of Sequential Patterns over Data Stream. In: Alhajj, R., Gao, H., Li, X., Li, J., Zaïane, O.R. (eds.) ADMA 2007. LNCS (LNAI), vol. 4632, pp. 401–411. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Masseglia, F., Poncelet, P., Teisseire, M.: Incremental mining of sequential patterns in large databases. Data & Knowledge Engineering 46(1), 97–121 (2003)

    Article  Google Scholar 

  14. Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth. In: ICDE 2001, pp. 215–224. IEEE, Los Alamitos (2001)

    Google Scholar 

  15. Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach. IEEE Transaction on Knowledge and Data Engineering 16(11), 1424–1440 (2004)

    Article  Google Scholar 

  16. Plantevit, M., Laurent, A., Teisseire, M.: HYPE: mining hierarchical sequential patterns. In: DOLAP 2006, pp. 19–26. ACM Press, New York (2006)

    Chapter  Google Scholar 

  17. Ren, J.-D., Zhou, X.-L.: An Efficient Algorithm for Incremental Mining of Sequential Patterns. In: Yeung, D.S., Liu, Z.-Q., Wang, X.-Z., Yan, H. (eds.) ICMLC 2005. LNCS (LNAI), vol. 3930, pp. 179–188. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  18. Wu, X., Zhang, C., Zhang, S.: Efficient Mining of Both Positive and Negative Association Rules. ACM Transaction on Information Systems 22(3), 381–405 (2004)

    Article  Google Scholar 

  19. Zhu, T., Bai, S.: A Parallel Mining Algorithm for Closed Sequential Patterns. In: AINA 2007, vol. 1, pp. 392–395. IEEE Computer Society, Los Alamitos (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Il-Yeol Song Johann Eder Tho Manh Nguyen

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kazienko, P. (2008). Mining Sequential Patterns with Negative Conclusions. In: Song, IY., Eder, J., Nguyen, T.M. (eds) Data Warehousing and Knowledge Discovery. DaWaK 2008. Lecture Notes in Computer Science, vol 5182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85836-2_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85836-2_40

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics