(1) set the minimum support criterion at 0.6, identify the frequent 2-itemsets;
| Transaction | Item Purchased | ||
| 1 | A | B | C |
| 2 | A | C | D |
| 3 | B | C | D |
| 4 | A | D | E |
| 5 | B | C | E |
| 1 item set | Support |
| 2 itemset | Support |
| Frequent 2 Itemsets |
calculate lift ratio for below rules and interpret the results
| Rule | Support of Antecedent {a} | Support of Consequent {c} | Support of {a & c} | The confidence of the Rule | Lift Ratio of the Rule | Interpretation on Lift Ratio |
| A-->D | ||||||
| C-->A | ||||||
| A-->C | ||||||
| B&C-->D |
According to Association , the minimum support = number of transaction * support criterion = 5 * 60 /100 = 3
Item set = A B C D E
Support count () = frequency of
an item set
Hence, the three minimum support and frequent data sets are B,C ; A,C ; C,D
Calculating the lift ratio
| Rule | Support of Antecedent {a} | Support of Consequent {c} | Support of {a & c} | The confidence of the Rule | Lift Ratio of the Rule |
| A-->D | 3/5 = 0.6 | 3/5 = 0.6 | 2/5 = 0.4 | Confidence(A,D)/ Expected confidence(D) = 40% /60%= 0.67 | |
| C-->A | 4/5= 0.8 | 3/5 = 0.6 | 2/5 = 0.4 | 0.5 | 0.4/0.6 = 0.67 |
| A-->C | 3/5 = 0.6 | 4/5=0.8 | 2/5= 0.4 | 0.67 | 0.4/ 0.8 = 0.5 |
| B&C-->D | 1/5=0.2 | 3/5 = 0.6 | 1/5= 0.2 | 0.2/0.6= 0.33 |
( *The below value means that the number of transaction occurance of A->D and the total transactions of A.
|
Rule |
Support of Antecedent {a} |
| A-->D | 2/4 = 0.5 |
)
Based on the Lift ratio,
The life ratio implies the relationship between the antecedent and consequent. The probability will increase with the increase in the lift ratio.
(1) set the minimum support criterion at 0.6, identify the frequent 2-itemsets; Transaction It...
A grocery store introducing items from Italy is interested in analyzing buying trends of new international items: prosciutto, pepperoni, risotto, and gelato. a. Using a minimum support of 100 transactions and a minimum confidence of 50 percent, use XLMiner to generate a list of association rules. How many rules satisfy this criterion? b. Using a minimum support of 250 transactions and a minimum confidence of 50 percent, use XLMiner to generate a list of association rules. How many rules satisfy...
Use the set of the frequent item sequences to generate
sequential rules (No need to generate the frequent item
sequences!). For each rule, calculate the support and the
confidence.
Here is an example: consider the rule the frequent itemset <{
Eggs },{Tomatoes},{Vinegar}>. From this itemset we can create a
sequential rule <{ Eggs },{Tomatoes}> -> <{Vinegar}>
which says that if a customer bought Eggs and Tomatoes already,
they are likely to buy Vinegar at a later time. Remember, the order...
Table 1: Data set of market-basket transactions ansaction ID Items Bought [A, B, D, E (B, C, D (A, B, D, E) A, C, D, E) (B,C, D, E B, D, E (C, D) (A, B, C (A, D, E) 6 7 [15 points] Answer the following questions for the data set in Table 1. (a) What is the maximum number of association rules that can be extracted from this data set (including rules that have zero support)? (b) What...
Consider the transactional database shown in the following table. Transaction ID Items Bought T100 Plum, Apple, Peach, Orange, Pear, Banana T200 Cherry, Apple, Peach, Orange, Pear, Banana T300 Plum, Mango, Orange, Pear, Kiwi, Strawberry T400 Plum, Watermelon, Avocado, Orange, Banana T500 Avocado, Apple, Orange, Lemon, Pear CONDITION: The minimum support is 60% and minimum confidence is 70%. Based on the CONDITION above, answer the following five questions. (1) Find all frequent itemsets using the Apriori algorithm. Show how the algorithm...
Consider the data set of market basket transactions shown in following table: Customer ID Transaction ID Items Bought 1 0001 {a,d,e,f} 1 0024 {a,b,c} 2 0012 {b,d,e,f} 2 0031 {a,c,e} 3 0015 {b,d,f} 3 0022 {a,b} 4 0029 {a,b,c} 4 0040 {a,b,d,e} 5 0033 {e,b,d} 5 0038 {f,c,e} Compute the support(%) for itemsets {e}, {b, d}, and {b, d, e} by treating each transaction ID as a market basket. Use the results in part (a) to compute the confidence for...
2. The Apriori algorithm makes use of prior knowledge of subset support properties. (a) Prove that all nonempty subsets of a frequent itemset must also be frequent. (b) Prove that the support of any nonempty subset s′ of itemset s must be at least as great as the support of s. (c) Given frequent itemset l and subset s of l, prove that the confidence of the rule “s′ ⇒(l−s′)” cannot be more than the confidence of“s⇒(l−s),” where s′ is...
I
need help with a data mining problem
Consider the following transaction dataset. T1: a, d, e T2: a, b, c, e T2: a, b, d, e T4: a, c, d, e T5: b, c, e T6: b, d, e T7:c, d T8: a, b, d a) Compute the support for itemsets {e}, {b, d}, and {b, d, e}. b) Compute the confidence for the association rules {b, d} rightarrow {e} and {e} rightarrow {b, d). c) Is confidence a...
Use the set of the frequent item sequences to generate sequential rules (No need to generate the frequent item sequences!). For each rule, calculate the support and the confidence. Consider a threshold on support of 2 items. Show all the steps and work in excel or any format except knime software. in addition to the below picture please see the data: 1 3 -1 2 -1 7 -1 5 -1 8 -1 -2 3 4 -1 2 -1 1 -1...
(1)A database has five transactions (T100 to T500) as shown in the table below. Let min sup-3 and mi-conf-8090. TID T100 M, O, N, K, E, Y T200 D, O, N, K, E, Y ) T300{M, A, K, E) T400 M, U, C, K, Y) T500 | {C, О. О. К. 1 ,E) items bought Find all the frequent itemset晜using Apriori algorithm. You must show the contents of Ck and Lk tables in each step (please refer to your lecture...
We are given four items, namely A, B, C, and D. Their corresponding unit profits are pA, pB, pC, and pD. The following shows five transactions with these items. Each row corresponds to a transaction where a non-negative integer shown in the row corresponds to the total number of occurrences of the correspondence item present in the transaction. T A B C D t1 0 0 3 2 t2 3 4 0 0 t3 0 0 1 3 t4 1...