Skip to main content
SpringerLink
Log in

Convertible Constraints

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems

Synonyms

Convertible antimonotone constraints; Convertible antimonotonic constraints; Convertible monotone constraints; Convertible monotonic constraints

Definition

A constraint C is convertible if and only if C is convertible antimonotone or convertible monotone. A constraint C is convertible antimonotone provided there is an order R on items such that when an ordered itemset S satisfies constraint C, so does any prefix of S. A constraint C is convertible monotone provided there is an order R′ on items such that when an ordered itemset S′ violates constraint C, so does any prefix of S′.

Key Points

Although some constraints are neither antimonotone nor monotone in general, several of them can be converted into antimonotone or monotone ones by properly ordering the items. These convertible constraints [3654,3655,3] possess the following nice properties. By arranging items according to some proper order R, if an itemset S satisfies a convertible antimonotone constraint Ccam, then all...

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

Access this chapter

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

Institutional subscriptions

Recommended Reading

  1. Pei J, Han J. Can we push more constraints into frequent pattern mining? In: Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2000. p. 350–4.

    Google Scholar 

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

  3. Pei J, Han J, Lakshmanan LVS. Pushing convertible constraints in frequent itemset mining. Data Mining Knowl Discov. 2004;8(3):227–52. https://doi.org/10.1023/B:DAMI.0000023674.74932.4c.

    Article  MathSciNet  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). Convertible 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_5047

Download citation

Publish with us

Policies and ethics

Search

Navigation