Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Pattern Space Pruning with Monotonicity Constraints

  • A constraint C is monotone if the pattern satisfies C, we do not need to check C in subsequent mining
  • Alternatively, monotonicity: If an itemset S satisfies the constraint, so does any of its superset
  • Ex. 1. sum(S.Price) ≥ v is monotone
  • Ex. 2. min(S.Price) v is monotone
  • Ex. 3. C: range(S.profit) 15
    • Itemset ab satisfies C
    • So does every superset of ab

Speaker notes:

Content Tools


There are currently no sources for this slide.