Jure Leskovec, Stanford University - SNAP - Stanford University
Jure Leskovec, Stanford University - SNAP - Stanford University
Jure Leskovec, Stanford University - SNAP - Stanford University
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Observation: Subsets of a frequent itemset are freq<br />
Consequence: Build frequent itemsets bottom up<br />
Example: Items = {milk, coke, pepsi, beer, juice}<br />
Min Support = 3 baskets<br />
B 1 = {m, c, b} B 2 = {m, c, j}<br />
B 3 = {m, b} B 4= {c, j}<br />
B 5 = {m, p, b} B 6 = {m, c, b, j}<br />
B 7 = {c, b, j} B 8 = {b, c}<br />
Frequent 1-sets: {m}, {c}, {b}, {j}<br />
Frequent 2-sets: {m,c}, {m,b}, {m,j}, {c,b}, {c,j}, {b,j}<br />
Need not even consider sets {p, *} as {p} is not frequent<br />
Frequent 3-sets: only need to check {m, c, b}<br />
3/9/2011 <strong>Jure</strong> <strong>Leskovec</strong>, <strong>Stanford</strong> C246: Mining Massive Datasets 39
Change language