COMPUTER S CS 6530
View the step-by-step solution to:

# Suppose the Apriori algorithm is applied to the data set shown in the following table with minsup = 30%, i., any itemset occurring in less than 3...

Suppose the Apriori algorithm is applied to the data set shown in the following table with minsup = 30%, i.e., any itemset occurring in less than 3 transactions is considered to be infrequent.

Transaction ID  Items Bought

1

{a, b, d, e}

2

{b, c, d}

3

{a, b, d, e}

4

{a, c, d, e}

5

{b, c, d, e}

6

{b, d, e}

7

{c, d}

8

{a, b, c}

9

{a, d, e}

10

{b, d}

(a) Use the arules package in R, generate all frequent item sets when the minimum support is 30%. List them by support in decreasing order.

(b) Use the arules package in R, generate all association rules when the minimum support is 30% and the minimum confidence is 50%. List them by lift in decreasing order.

### Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

### -

Educational Resources
• ### -

Study Documents

Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

Browse Documents