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 ti ⊆ I. 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|t ∈ D ∧ X ⊆ t}|∕|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....
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Liu, G. (2018). Max-Pattern Mining. 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_216
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_216
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering