and 3 others joined a min ago.
0
5.1kviews
Use the Apriori to algorithm to identify the frequent item-sets in the following database. Then extract the strong association rules from these sets.
written 6.9 years ago by
ashishravindrasalve
• 920
|
modified 5.6 years ago
by
prashantsaini
• 0
|
Min. Support = 30% Min. Confidence=75%
| TID | Items |
|---|---|
| 01 | A, B, D, E, F |
| 02 | B, C, E |
| 03 | A, B, D, E |
| 04 | A, B, D, E |
| 05 | A, B, C, D, E, F |
| 06 | B, C, D |
| 07 | A, B, D, E |
ADD COMMENT
EDIT
1 Answer
and 3 others joined a min ago.