and 4 others joined a min ago.
0
4.2kviews
Find all frequent itemset using apriori algorithm. Assume minimum support = 40%
1 Answer
0
148views
written 8.0 years ago by
teamques10
★ 70k
|
| TID | Items |
|---|---|
| 01 | A,B,C,D |
| 02 | B,C,D |
| 03 | A,B,E |
| 04 | B,D |
| 05 | A,B,C,E |
Support count = 40%
x/5 * 100 = 50
x = 3
Step 1:
Generating 1-itemset frequent pattern
Scan D for count of each candidate
C1 =
| Itemset | Supportcount |
|---|---|
| {A} | 3 |
| {B} | 5 |
| {D} | 3 |
| {C} | 2 |
| {E} … |
and 2 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.