The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 3 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
Consider the following transaction database:
  TID     Items
  -------------------------
  01      A, B, C, D, F
  02      A, B, C, D, E, G
  03      A, C, G, H, K
  04      B, C, D, E, H, K
  05      D, E, F, H, L
  06      A, B, C, K, L
  07      A, D, F, L
  08      B, I, E, K, L
  09      C, D, F, L
  10      A, B, D, E, K
  11      C, D, H, I, K
  12      C, E, F, K
  13      B, C, D, F
  14      A, B, C, D
  15      C, H, I, J, K
  16      A, D, E, F, H, L
  17      H, K, L
  18      A, D, H, K
  19      D, E, F, K, L
  20      B, C, D, E, H, L
Applying the Apriori algorithm with minimum support of 30% and minimum confidence of 75%, find all the association rules in the data set. Give details of your computation at each step, however, at each step give only the frequent itemsets that satisfy minimum support (i.e., itemsets which appear in at least 6 transactions). Also specify the confidence and improvement for each of the rules you discovered. (Hint: similar problem could be found on slide 67 of handout4)
-----------