Skip to main content
SpringerLink
Log in

Analyzing Sequential Patterns in Retail Databases

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Finding correlated sequential patterns in large sequence databases is one of the essential tasks in data mining since a huge number of sequential patterns are usually mined, but it is hard to find sequential patterns with the correlation. According to the requirement of real applications, the needed data analysis should be different. In previous mining approaches, after mining the sequential patterns, sequential patterns with the weak affinity are found even with a high minimum support. In this paper, a new framework is suggested for mining weighted support affinity patterns in which an objective measure, sequential ws-confidence is developed to detect correlated sequential patterns with weighted support affinity patterns. To efficiently prune the weak affinity patterns, it is proved that ws-confidence measure satisfies the anti-monotone and cross weighted support properties which can be applied to eliminate sequential patterns with dissimilar weighted support levels. Based on the framework, a weighted support affinity pattern mining algorithm (WSMiner) is suggested. The performance study shows that WSMiner is efficient and scalable for mining weighted support affinity patterns.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ester M. A top-down method for mining most specific frequent patterns in biological sequence data. In Proc. the 4th SIAM Int. Conf. Data Mining, Lake Buena Vista, Florida, USA, April 22–24, 2004, pp.91–101.

  2. Wang K, Xu Y, Yu J X. Scalable sequential pattern mining for biological sequences. In Proc. the 2004 ACM CIKM Int. Conf. Information and Knowledge Management, Washington DC, USA, November 8–13, 2004, pp.178–187.

  3. Cheng H, Yan X, Han J. IncSpan: Incremental mining of sequential patterns in large databases. In Proc. the 10th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, Seattle, USA, August 22–25, 2004, pp.527–532.

  4. Chung H, Yan X, Han J. SeqIndex: Indexing sequences by sequential pattern analysis. In Proc. the 5th SIAM Int. Conf. Data Mining, Newport Beach, USA, April 21–23, 2005, pp.601–605.

  5. Pinto H, Han J, Pei J, Wang K. Multi-dimensional sequence pattern mining. In Proc. the 2001 ACM CIKM Int. Conf. Information and Knowledge Management, Atlanta, USA, November 5–10, 2001, pp.81–88.

  6. Kum H C, Pei J, Wang W, Duncan D. ApproxMAP: Approximate mining of consensus sequential patterns. In Proc. the 3rd SIAM Int. Conf. Data Mining, San Francisco, USA, May 1–3, 2003, pp.311–315.

  7. Yang J, Yu P S, Wang W, Han J. Mining long sequential patterns in a noisy environment. In Proc. the 2002 ACM SIGMOD Int. Conf. Management of Data, Madison, USA, June 3–6, 2002, pp.406–417.

  8. Garofalakis M, Rastogi R, Shim K. SPIRIT: Sequential pattern mining with regular expression constraints. In Proc. 25th Int. Conf. Very Large Data Bases, September 7–10, 1999, Edinburgh, UK, pp.223–234.

  9. Lorincz H A, Boulicaut J F. Mining frequent sequential patterns under regular expressions: A highly adaptive strategy for pushing constraints. In Proc. the 3rd SIAM Int. Conf. Data Mining, San Francisco, USA, May 1–3, 2003, pp.316–320.

  10. Pei J, Han J, Wang W. Mining sequential patterns with constraints in large databases. In Proc. the 2002 ACM CIKM Int. Conf. Information and Knowledge Management, McLean, USA, November 4–9, 2002, pp.18–25.

  11. Wang J, Han J. BIDE: Efficient mining of frequent closed sequences. In Proc. the 20th Int. Conf. Data Engineering, March 30–April 2, 2004, Boston, MA, USA, pp.79–90.

  12. Yan X, Han J, Afshar R. CloSpan: Mining closed sequential patterns in large datasets. In Proc. the 3rd SIAM Int. Conf. Data Mining, San Francisco, CA, USA, May 1–3, 2003, pp.166–177.

  13. Yan X, Han J. gSpan: Graph-based substructure pattern mining. In Proc. the 2002 IEEE Int. Conf. Data Mining (ICDM 2002), Maebashi City, Japan, 9–12, December, 2002, pp.721–724.

  14. Chiu D Y, Wu Y H, Chen A L. An efficient algorithm for mining frequent sequences by a new strategy without support counting. In Proc. the 20th Int. Conf. Data Engineering, ICDE 2004, Boston, MA, USA, 30 March–2 April, 2004, pp.375–386.

  15. Pei J, Han J, Wang J et al. Mining sequential patterns by pattern-growth: The PrefixSpan approach. IEEE Trans. Knowledge and Data Engineering, Oct. 2004, 16(1): 1424–1440.

    Google Scholar 

  16. Zaki M. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning, January 2001, 42(1/2): 31–60.

    Article  MATH  Google Scholar 

  17. Srikant R, Agrawal R. Mining sequential patterns: Generalizations and performance improvements. In Proc. Advances in Database Technology — EDBT’96, 5th Int. Conf. Extending Database Technology, Avignon, France, March 25–29, 1996, pp.3–17.

  18. Agrawal R, Srikant R. Mining sequential patterns. In Proc. the 11th Int. Conf. Data Engineering, March 6–10, 1995, Taipei, pp.3–14.

  19. Han J, Pei J, Mortazavi-Asi B et al. FreeSpan: Frequent pattern-projected sequential pattern mining. In Proc. the 6th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, Boston, MA, USA, August 20–23, 2000, pp.355–359.

  20. Pei J, Han J, Mortazavi-Asi B, Pino H. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proc. the 17th Int. Conf. Data Engineering, Heidelberg, Germany, April 2–6, 2001, pp.215–224.

  21. Ayres J, Gehrke J, Yiu T, Flannick J. Sequential pattern mining using a bitmap representation. In Proc. the 8th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, July 23–26, 2002, pp.429–435.

  22. Tzvetkov P, Yan X, Han J. TSP: Mining Top-K closed sequential patterns. In Proc. the 3rd IEEE Int. Conf. Data Mining (ICDM 2003), Melbourne, Florida, USA, 19–22 December, 2003, pp.347–354.

  23. Yun U, Leggett J J. WFIM: Weighted frequent itemset mining with a weight range and a minimum weight. In Proc. the 5th SIAM Int. Conf. Data Mining, Newport Beach, USA, April 21–23, 2005, pp.636–640.

  24. Yun U, Leggett J J. WSpan: Weighted sequential pattern mining in large sequence databases. Int. Conf. IEEE Intelligent Systems (IEEE IS‘06), UK, 2006, pp.512–517.

Download references

Author information

Authors and Affiliations

  1. Electronics and Telecommunications Research Institute, Telematics & USN Research Division, LBS/Telematics Convergence Research Team, 161 Gajeong-dong, Yuseong-gu, Daejeon, 305-700, Korea

    Unil Yun

Authors
  1. Unil Yun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Unil Yun.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yun, U. Analyzing Sequential Patterns in Retail Databases. J Comput Sci Technol 22, 287–296 (2007). https://doi.org/10.1007/s11390-007-9036-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-007-9036-4

Keywords

Search

Navigation