Need help with my Computer Science question – I’m studying for my class.

Use the following table to answer questions 1 and 2.

1a.Identify a rule that has reasonably high support, but low confidence. Only state the rule; nothing more.

1b.Identify a rule that has low support and high confidence.Only state the rule; nothing more.

1c.Identify a rule that has high support and high confidence.Only state the rule; nothing more.

1d.Identify a rule that has low support and low confidence.Only state the rule; nothing more.

2a.By treating each transaction ID as a market basket, compute the support for each of the following itemsets:

s({e})=

s({b,d}) =

s({b, d, e}) =

2b.Compute the confidence for the following association rules:

c(b,d à e) =

c(e à b,d) =

2c.By treating each Customer ID as a market basket and treating each item as a binary variable where appearance of an item = 1 in which the customer bought the item (and a 0 otherwise), compute the support for each of the following itemsets:

s({e})=

s({b,d}) =

s({b, d, e}) =

2d.Use your results in 2c to the confidence for the following association rules:

c(b,d à e) =

c(e à b,d) =

Use the following market basket transactions to answer items in question 3.

3a.What is the maximum number of association rules that can be extracted from this data?

note: be sure to show your calculations

4.The following market basket transactions were used to create the itemset lattice that is next to the market basket.A candidate is discarded if any one of its subsets is found to be infrequent during the candidate pruning step.Support the Apriori algorithm is applied to the data set with minsup = 30%, any itemset occurring in less than 3 transactions is considered to be infrequent.

(a)

Complete the grid below in order to label each node in the lattice with the following letters:

Note: Begin by entering every itemset from the lattice into the table below.You may need to expand the grid in order to accommodate all of your responses.

N:

If the itemset is not considered to be a candidate itemsety the Apriori algorithm.Two reasons for an itemset not to be considered as a candidate itemset:a) it is not generated at all during the candidate generation step, or b) it is generated during the candidate generation step but is subsequently removed during the candidate pruning step because one of its subsets is found to be infrequent.

F:

If the candidate itemset is found to be frequent by the Apriori algorithm.

I: If the candidate itemset is found to be infrequent after support counting.

 Itemset Assigned letter (N, F, or I)

(b)

What is the percentage of frequent itemsets (with respect do all itemsets in the lattice)?