Skip to main content

Mining Sequential Support Affinity Patterns with Weight Constraints

  • Conference paper
Distributed Computing and Internet Technology (ICDCIT 2006)

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

  • 496 Accesses

Abstract

In this paper, we present a new algorithm, Weighted Sequential support affinity pattern mining in which a new measure, sequential s-confidence is suggested. By using the measure, sequential patterns with support affinity are generated. A comprehensive performance study shows that WSAffinity is efficient and scalable in weighted sequential pattern mining. Moreover, it generates fewer but important sequential patterns.

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 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

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: ICDE (1995)

    Google Scholar 

  2. Ayres, J., Gehrke, J., Yiu, T., Flannick, J.: Sequential Pattern Mining using A Bitmap Representation. In: SIGKDD 2002 (2002)

    Google Scholar 

  3. Chiu, D.Y., Wu, Y., Chen, A.L.P.: An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting. In: ICDE 2004 (2004)

    Google Scholar 

  4. Ester, M.: A Top-Down Method for Mining Most Specific Frequent Patterns in Biological Sequence Data. In: SDM 2004 (2004)

    Google Scholar 

  5. Garofalakis, M., Rastogi, R., Shim, K.: SPIRIT: Sequential pattern mining with regular expression constraints. In: VLDB 1999 (1999)

    Google Scholar 

  6. Han, J., Pei, J., Mortazavi-Asi, B., Chen, Q., Dayal, U., Hsu, M.C.: FreeSpan: Frequent Pattern-Projected Sequential Pattern Mining. In: SIGKDD 2000 (2000)

    Google Scholar 

  7. Kum, H.C., Pei, J., Wang, W., Duncan, D.: ApproxMAP: Approximate Mining of Consensus Sequential Patterns. In: SDM 2003 (2003)

    Google Scholar 

  8. Lorincz, H.A., Boulicaut, J.F.: Mining frequent sequential patterns under regular expressions: a highly adaptive strategy for pushing constraints. In: SDM 2003 (2003)

    Google Scholar 

  9. Pei, J., Han, J., Wang, W.: Mining Sequential Patterns with Constraints in Large Databases. In: CIKM 2002 (2002)

    Google Scholar 

  10. Pei, J., Han, J., Wang, J., Pinto, H., et al.: Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach. IEEE Transactions on Knowledge and Data Engineering, rgrg (October 2004)

    Google Scholar 

  11. Pinto, H., Han, J., Pei, J., Wang, K.: Multi-domensional Sequence Pattern Mining. In: CIKM 2001 (2001)

    Google Scholar 

  12. Yun, U., Leggett, J.J.: WFIM: Weighted Frequent Itemset Mining with a weight range and a minimum weight. In: International conference on SIAM Data Mining (SDM 2005) (April 2005)

    Google Scholar 

  13. Yun, U., Leggett, J.J.: WSpan: Weighted Sequential pattern mining in large sequence databases. In: International conference on IEEE Intelligent Systems (IEEE IS 2006) (2006)

    Google Scholar 

  14. Zaki, M.: SPADE: An efficient algorithm for mining frequent sequences. Machine Learning (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yun, U. (2006). Mining Sequential Support Affinity Patterns with Weight Constraints. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds) Distributed Computing and Internet Technology. ICDCIT 2006. Lecture Notes in Computer Science, vol 4317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11951957_36

Download citation

  • DOI: https://doi.org/10.1007/11951957_36

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68380-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics