Tutorvo

The Apriori Idea: Pruning 3-Item Sets Before You Count Them

Lesson 7 of 820 minLab

This lesson is part of the course

In this lesson

You flag the frequent pairs, use them to keep or prune five candidate 3-item sets the way the Apriori algorithm does, and count the support of the candidates straight from the baskets.

Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.

Lessons in this course

  1. Baskets as 0/1 Rows: Item Frequency and SupportLab12 min Locked
  2. Pair Support with SUMPRODUCT: the Co-Occurrence MatrixLab18 min Locked
  3. Confidence A → B: How Often B Follows ALab15 min Locked
  4. Lift: Is the Rule Better than Chance?Lab18 min Locked
  5. Leverage and Conviction: Size and Direction of a RuleLab15 min Locked
  6. Filtering Rules by Minimum Support and Confidence, Ranking by LiftLab18 min Locked
  7. The Apriori Idea: Pruning 3-Item Sets Before You Count ThemLab20 min Locked
  8. From Rules to Cross-Selling: Expected Uplift per RecommendationLab18 min Locked