Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Max-Pattern Mining

  • Guimei Liu
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_216

Synonyms

Maximal itemset mining

Definition

Let I = {i1, i2…, in} be a set of items and D = {t1, t2…, tN} be a transaction database, where ti(i ∈ [1, N]) is a transaction and tiI. Every subset of I is called an itemset. If an itemset contains k items, then it is called a k-itemset. The support of an itemset X in D is defined as the percentage of transactions in D containing X, that is, sup(X) = |{t|tDXt}|∕|D|. If the support of an itemset exceeds a user-specified minimum support threshold, then the itemset is called a frequent itemset or a frequent pattern. If an itemset is frequent but none of its supersets is frequent, then the itemset is called a maximal pattern. The task of maximal pattern mining is given a minimum support threshold, to enumerate all the maximal patterns from a given transaction database.

The concept of maximal patterns can be and has already been extended to more complex patterns, such as sequential patterns, frequent subtrees, and frequent subgraphs....

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

Recommended Reading

  1. 1.
    Agrawal R, Srikant R. Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th International Conference on Very Large Data Bases; 1994. p. 487–99.Google Scholar
  2. 2.
    Agarwal RC, Aggarwal CC, Prasad VVV. Depth first generation of long patterns. In: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2000. p. 108–18.Google Scholar
  3. 3.
    Bayardo RJ Jr. Efficiently mining long patterns from databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1998. p. 85–93.Google Scholar
  4. 4.
    Burdick D, Calimlim M, Gehrke J. Mafia: a maximal frequent itemset algorithm for transactional databases. In: Proceedings of the 17th International Conference on Data Engineering; 2001. p. 443–52.Google Scholar
  5. 5.
    Gouda K, Zaki MJ. GenMax: efficiently mining maximal frequent itemsets. In: Proceedings of the 1st IEEE International Conference on Data Mining; 2001. p. 163–70.Google Scholar
  6. 6.
    Gunopulos D, Mannila H, Saluja S. Discovering all most specific sentences by randomized algorithms. In: Proceedings of the 6th International Conference on Database Theory; 1997. p. 215–29.Google Scholar
  7. 7.
    Lin DI, Kedem ZM. Pincer search: a new algorithm for discovering the maximum frequent set. In: Advances in Database Technology, Proceedings of the 1st International Conference on Extending Database Technology; 1998. p. 105–19.Google Scholar
  8. 8.
    Liu G, Lu H, Lou W, Xu Y, Yu JX. Efficient mining of frequent patterns using ascending frequency ordered prefix-tree. Data Min Knowl Disc. 2004;9(3):249–74.MathSciNetCrossRefGoogle Scholar
  9. 9.
    Rymon R. Search through systematic set enumeration. In: Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning; 1992. p. 268–75.Google Scholar
  10. 10.
    Xiao Y, Yao JF, Li Z, Dunham MH. Efficient data mining for maximal frequent subtrees. In: Proceedings of the 3rd IEEE International Conference on Data Mining; 2003. p. 379–86.Google Scholar
  11. 11.
    Yang G. The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2004. p. 344–53.Google Scholar
  12. 12.
    Yang J, Wang W, Yu PS, Han J. Mining long sequential patterns in a noisy environment. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2002. p. 406–17.Google Scholar
  13. 13.
    Zaki MJ, Parthasarathy S, Ogihara M, Li W. New algorithms for fast discovery of association rules. In: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining; 1997. p. 283–6.Google Scholar

Copyright information

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

Authors and Affiliations

  1. 1.Institute for Infocomm ResearchSingaporeSingapore

Section editors and affiliations

  • Jian Pei
    • 1
  1. 1.School of Computing ScienceSimon Fraser Univ.BurnabyCanada