Encyclopedia of Database Systems

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

Anti-monotone Constraints

  • Carson Kai-Sang LeungEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_5046


Anti-monotonic constraints


A constraint C is anti-monotone if and only if for all itemsets S and S′:
$$ \mathrm{if}\ S\supseteq {S}^{\prime}\;\mathrm{and}\ S\ \mathrm{satisfies}\ C,\mathrm{then}\;{S}^{\prime}\ \ \mathrm{satisfies}\ C. $$
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    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.CrossRefGoogle Scholar
  2. 2.
    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

Copyright information

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

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of ManitobaWinnipegCanada

Section editors and affiliations

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