Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Database Systems pp 1531–1536Cite as

Frequent Itemset Mining with Constraints

  • Reference work entry
  • First Online:

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↦...

This is a preview of subscription content, 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

Learn about institutional subscriptions

Recommended Reading

  1. 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.

    Google Scholar 

  2. 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.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Article  Google Scholar 

  6. 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.

    Google Scholar 

  7. 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.

    Google Scholar 

  8. 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.

    Article  Google Scholar 

  9. 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.

    Article  Google Scholar 

  10. Leung CK-S. Uncertain frequent pattern mining. In: Aggarwal C, Han J, editors. Frequent pattern mining. Boston: Springer; 2014. p. 417–53.

    MATH  Google Scholar 

  11. 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.

    Article  Google Scholar 

  12. 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.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. 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.

    Google Scholar 

  15. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Manitoba, Winnipeg, MB, Canada

    Carson Kai-Sang Leung

Authors
  1. Carson Kai-Sang Leung
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Carson Kai-Sang Leung .

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

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

Publish with us

Policies and ethics

Search

Navigation