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 Succinctness

  • Succinctness:
    • Given A1, the set of items satisfying a succinctness constraint C, then any set S satisfying C is based on A1 , i.e., S contains a subset belonging to A1
    • Idea: Without looking at the transaction database, whether an itemset S satisfies constraint C can be determined based on the selection of items
    • min(S.Price) ≤ v is succinct
    • sum(S.Price) ≥ v is not succinct
  • Optimization: If C is succinct, C is pre-counting pushable

Speaker notes:

Content Tools


There are currently no sources for this slide.