Skip to main content
SpringerLink
Log in

Sequential Patterns

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems

  • 12 Accesses

Synonyms

Frequent subsequences

Definition

A sequence database D = {S1, S2,…,Sn} for sequential pattern mining consists of n input sequences (where n ≥ 1), and an input sequence Si = 〈ei1, ei2, … , eim〉(1 ≤ i ≤ n) is an ordered list of m events (where m ≥1). Each event\( {e}_{i_j}\left(1\le i\le n,1\le j\le m\right) \) is a non-empty set of items. Given two sequences, Sa = 〈ea1, ea2, … , eak〉 and Sb = 〈eb1, eb2, … , ebl〉, if k ≤ l and there exist integers 1≤x1<x2< … < xk ≤l such that \( {e}_{a1}\subseteq {e}_{b_{x1}},{e}_{a2}\subseteq {e}_{b_{x2}},\ldots,{e}_{ak}\subseteq {e}_{b{{}_x}_k},{S}_b \) is said to contain Sa (or equivalently, Sa is said to be contained in Sb). The number of input sequences in D that contain sequence S is called the support of S in D, denoted by supD (S). Given a user-specified minimum support threshold min_sup, S is called a sequential pattern (or a frequent subsequence) in D if supD (S)≥min_sup. If there exists no proper supersequence of a sequential pattern S...

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.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

Recommended Reading

  1. Agrawal R, Srikant R. Mining sequential patterns. In: Proceedings of the 11th International Conference on Data Engineering; 1995.

    Google Scholar 

  2. Aggarwal CC, Ta N, Wang J, Feng J, Zaki MJ. XProj: a framework for projected structural clustering of XML documents. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2007.

    Google Scholar 

  3. Ayres J, Gehrke J, Yiu T, Flannick J. Sequential pattern mining using a bitmap representation. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2002.

    Google Scholar 

  4. Han J, Pei J, Mortazavi-Asl B, Chen Q, Dayal U, Hsu MC. FreeSpan: frequent pattern-projected sequential pattern mining. In: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2000.

    Google Scholar 

  5. Li Z, Chen Z, Srinivasan S, Zhou Y. C-Miner: mining block correlations in storage systems. In: Proceedings of the 3rd USENIX Conference of on File and Storage Technologies; 2004.

    Google Scholar 

  6. Li Z, Lu S, Myagmar S, Zhou Y. CP-Miner: finding copy-paste and related bugs in large-scale software code. IEEE Trans Softw Eng. 2006;32(3):176–92.

    Article  Google Scholar 

  7. Lo D, Khoo SC SMArTIC: towards building an accurate, robust and scalable specification miner. In: Proceedings of the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering; 2006.

    Google Scholar 

  8. Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu MC. PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern-growth. In: Proceedings of the 17th International Conference on Data Engineering; 2001.

    Google Scholar 

  9. She R, Chen F, Wang K, Ester M, Gardy JL, Brinkman FSL. Frequent-subsequence-based prediction of outer membrane proteins. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2003.

    Google Scholar 

  10. Srikant R, Agrawal R Mining sequential patterns: generalizations and performance improvements. In: Advances in Database Technology, Proceedings of the 5th International Conference on Extending Database Technology; 1996.

    Google Scholar 

  11. Sun G, Liu X, Cong G, Zhou M, Xiong Z, Lee J, Lin CY. Detecting erroreous sentences using automatically mined sequential patterns. In: Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics; 2007.

    Google Scholar 

  12. Wang J, Han J, Li C. Frequent closed sequence mining without candidate maintenance. IEEE Trans Knowl Data Eng. 2007;19(8):1042–56.

    Article  Google Scholar 

  13. Xie T, Pei J. Data mining for software engineering. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2006.

    Google Scholar 

  14. Yan X, Han J, Afshar R CloSpan: mining closed sequential patterns in large databases. In: Proceedings of the 2003 SIAM International Conference on Data Mining; 2003.

    Chapter  Google Scholar 

  15. Zaki MJ. SPADE: an efficient algorithm for mining frequent sequences. Mach Learn. 2001;42(1/2):31–60.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tsinghua University, Beijing, China

    Jianyong Wang

Authors
  1. Jianyong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianyong Wang .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. School of Computing Science, Simon Fraser Univ., Burnaby, British Columbia, Canada

    Jian Pei

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Wang, J. (2018). Sequential Patterns. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_343

Download citation

Publish with us

Policies and ethics

Search

Navigation