Synonyms
Constrained frequent itemset mining; Constraint-{\break}based frequent itemset mining; Frequent pattern mining with constraints; Frequent set mining with constraints
Definition
Let Item = {item1, item2, … , itemm} be a set of domain items, where each item represents an object in a specific domain. Each object is associated with some attributes or auxiliary information about the object. A transaction ti = 〈tID, Ii〉 is a tuple, where tID is a unique identifier and Ii ⊆ Item is a set of items. A set of items is also known as an itemset. A transaction database (TDB) is a collection of transactions. An itemset S is contained in a transaction ti = 〈tID, Ii〉 if S ⊆ Ii. The support (or frequency) of an itemset S in a TDB is the number (or percentage) of transactions in the TDB containing S. An itemset is frequent if its support exceeds or equals a user-specified minimum support threshold minsup. A user-specified constraint C is a predicate on the powerset of Item (i.e., C : 2Item↦...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2003. p. 207–16.
Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases; 1994. p. 487–99.
Bonchi F, Lucchese C. Pushing tougher constraints in frequent pattern mining. In: Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference; 2005. p. 114–24.
Bucila C, Gehrke J, Kifer D, White W. DualMiner: a dual-pruning algorithm for itemsets with constraints. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2002. p. 42–51.
Cuzzocrea A, Leung CK-S, MacKinnon RK. Mining constrained frequent itemsets from distributed uncertain data. Futur Gener Comput Syst. 2014;37:117–26. https://doi.org/10.1016/j.future.2013.10.026.
Gade K, Wang J, Karypis G. Efficient closed pattern mining in the presence of tough block constraints. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2004. p. 138–47.
Grahne G, Lakshmanan LVS, Wang X. Efficient mining of constrained correlated sets. In: Proceedings of the 16th International Conference on Data Engineering; 2000. p. 512–21.
Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2000. p. 1–12.
Lakshmanan LVS, Leung CK-S, Ng RT. Efficient dynamic mining of constrained frequent sets. ACM Trans Database Syst. 2003;28(4):337–89. https://doi.org/10.1145/958942.958944.
Leung CK-S. Uncertain frequent pattern mining. In: Aggarwal C, Han J, editors. Frequent pattern mining. Boston: Springer; 2014. p. 417–53.
Leung CK-S, Lakshmanan LVS, Ng RT. Exploiting succinct constraints using FP-trees. ACM SIGKDD Explor. 2002;4(1):40–9. https://doi.org/10.1145/568574.568581.
Ng RT, Lakshmanan LVS, Han J, Pang A. Exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1998. p. 13–24.
Pei J, Han J, Lakshmanan LVS. Mining frequent item sets with convertible constraints. In: Proceedings of the 17th International Conference on Data Engineering; 2001. p. 433–42.
Srikant R, Vu Q, Agrawal R. Mining association rules with item constraints. In: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining; 1997. p. 67–73.
Yun U, Leggett J. WLPMiner: weighted frequent pattern mining with length-decreasing support constraints. In: Advances in Knowledge Discovery and Data Mining, 9th Pacific-Asia Conference; 2005. p. 555–67.
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
Leung, C.KS. (2018). Frequent Itemset Mining with Constraints. 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_170
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_170
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