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.

Can Apriori Handle Convertible Constraints?

  • A convertible, not monotone nor anti-monotone nor succinct constraint cannot be pushed deep into the an Apriori mining algorithm
    • Within the level wise framework, no direct pruning based on the constraint can be made
    • Itemset df violates constraint C: avg(X) >= 25
    • Since adf satisfies C, Apriori needs df to assemble adf, df cannot be pruned
  • But it can be pushed into frequent-pattern growth framework!

Speaker notes:

Content Tools


There are currently no sources for this slide.