Skip to main content
SpringerLink
Log in

Pattern-Growth Methods

  • Living reference work entry
  • First Online:
Encyclopedia of Database Systems

Definition

Pattern-growth is one of several influential frequent pattern mining methodologies, where a pattern (e.g., an itemset, a subsequence, a subtree, or a substructure) is frequent if its occurrence frequency in a database is no less than a specified minimum_support threshold. The (frequent) pattern-growth method mines the data set in a divide-and-conquer way: It first derives the set of size-1 frequent patterns, and for each pattern p, it derives p’s projected (or conditional) database by data set partitioning and mines the projected database recursively. Since the data set is decomposed progressively into a set of much smaller, pattern-related projected data sets, the pattern-growth method effectively reduces the search space and leads to high efficiency and scalability.

Historical Background

Frequent itemset mining was first introduced as an essential subtask of association rule mining by Agrawal et al. [1]. A candidate set generation-and-test approach, represented by the...

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

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases. In: Proceedings ACM-SIGMOD international conference on management of data. 1993. p. 207–16.

    Google Scholar 

  2. Agrawal R, Srikant R Fast algorithms for mining association rules. In: Proceedings 20th international conference on very large data bases.1994. p. 487–99.

    Google Scholar 

  3. Chen C, Yan X, Zhu F, Han J. gApprox: mining frequent approximate patterns from a massive network. In: Proceedings 2007 IEEE international conference on data Mining. 2007. p. 445–50.

    Google Scholar 

  4. Cheng H, Yan X, Han J, Yu PS. Direct discriminative pattern mining for effective classification. In: Proceedings 24th international conference on data engineering. 2008.

    Google Scholar 

  5. Goethals B, Zaki M. An introduction to workshop on frequent itemset mining implementations. In: Proceedings ICDM international workshop on frequent itemset mining implementations. 2003. p. 1–13.

    Google Scholar 

  6. Grahne G, Zhu J. Efficiently using prefix-trees in mining frequent itemsets. In: Proceedings ICDM international workshop on frequent itemset mining implementations. 2003.

    Google Scholar 

  7. Han J, Cheng H, Xin D, Yan X. Frequent pattern mining: current status and future directions. Data Mining Knowl Discov. 2007;15:55–86.

    Article  MathSciNet  Google Scholar 

  8. Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation. In: Proceedings ACM-SIGMOD international conference on management of data. 2000. p. 1–12.

    Google Scholar 

  9. Liu J, Paulsen S, Sun X, Wang W, Nobel A, Prins J. Mining approximate frequent itemsets in the presence of noise: Algorithm and analysis. In: Proceedings SIAM international conference on data mining. 2006. p. 405–16.

    Google Scholar 

  10. Pan F, Cong G, Tung AKH, Yang J, Zaki M. CARPENTER: Finding closed patterns in long biological datasets. In: Proceedings 9th ACM SIGKDD international conference on knowledge discovery and data mining. 2003. p. 637–42.

    Google Scholar 

  11. Pei J, Han J, Mortazavi-Asl B, Wang J, Pinto H, Chen Q, Dayal U, Hsu M-C. Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans Knowl Data Eng. 2004;16:1424–40.

    Article  Google Scholar 

  12. Pei J, Zhang X, Cho M, Wang H, Yu PS. Maple: a fast algorithm for maximal pattern-based clustering. In: Proceedings IEEE international conference on data mining. 2001. p. 259–66.

    Google Scholar 

  13. Wang J, Han J, Pei J. CLOSET+: Searching for the best strategies for mining frequent closed itemsets. In: Proceedings 9th ACM SIGKDD international conference on knowledge discovery and data mining. 2003. p. 236–45.

    Google Scholar 

  14. Yan X, Han J. gSpan: Graph-based substructure pattern mining. In: Proceedings 2002 IEEE international conference on data mining. 2002. p. 721–24.

    Google Scholar 

  15. Zhu F, Yan X, Han J, Yu PS, Cheng H. Mining colossal frequent patterns by core pattern fusion. In: Proceedings 23rd international conference on data engineering. 2007. p. 706–15.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Illinois at Urbana-Champaign, Urbana, IL, USA

    Hong Cheng & Jiawei Han

Authors
  1. Hong Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiawei Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hong Cheng .

Editor information

Editors and Affiliations

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

    Ling Liu

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

    M. Tamer Özsu

Section Editor information

  1. School of Computing Science, Simon Fraser Univ., 8888 Univ. Drive, V5A 1S6, Burnaby, British Columbia, Canada

    Jian Pei

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media LLC

About this entry

Cite this entry

Cheng, H., Han, J. (2016). Pattern-Growth Methods. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_263-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_263-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation