(1)A database has five transactions (T100 to T500) as shown in the table below. Let min sup-3 and...
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...
Hi, I have problem related to data mining, as follow: Best Regards Assume a small database contains eight transactions as shown in Table 1. Let min_support=30% and min_conf=60%. (a) Find all frequent itemsets. (b) List all of the strong association rules (with support s and confidence c). (c) If you want to transform the knowledge obtained from the small database to a large database, do you need to adjust the min_support or min_conf thresholds? Why? Table 1. TID ID date...
A database has five transactions, where each letter, such as "M", represents an item: T_1 = {M, O, N, K, E, Y}; T_2 = {D, O, N, K, E, Y}; T_3 = {M, A, K, E}; T_4 = {M, U, C, K, Y}; T_5 = {C, O, K, I, E}; Let min-sup = 60% and min-conf = 80%, then Find all frequent itemsets; List all of the strong association rules (with support s greaterthanorequalto min-sup and c greaterthanorequalto min-conf) matching...