Question

Question 3 (10 marks) A large supermarket tracks sales data by stock-keeping unit (SKU) for each item, such as "pasta", "rice", "egg", "soup" is identified by a numerical SKU. The supermarket has a database of transactions where each transaction is a set of SKUs that were bought together. The database of transactions consist of following itemsets: Transaction ID Itemsets T1 egg, soup T2 rice, egg, soup T3 rice, soup T4 pasta, rice, egg, soup Copyright © 2015-2018 VIT, All Rights Reserved. 3 Vil VICTORIAN INSTITUTE TECHNOLOG T5 rice, egg T6 pasta, rice, soup pasta, rice Solve the above problem using Apriori Algorithm (Association Rule Mining) with minimum support of 3 and write each and every step.

Answer 1

Answer. Find all Frequent itemseto, using Aprons f Compare the efficiency of the raining process Ll: egg 61: Item set support-cassat egg 4 Soup 5 rice 6 Pasta 3 Itement as count 7 Soup ce Picha {egg, smp 3 MMH 4 X C2: Item-set sul-cout 12% Irenight sous {egg, soup 3 {egg, sice? Echang, tice) 3 segg, pasta} 1 x min-sut? Esuprice? | 4 soul, rice} Erice, posta? 3 soup, pastas 2 Erice , pasta3l 3 63 Item set sup count {egg, soup, sice3 2 {eggi rice, fastal 1 {soup, pice, pasta} 2 y Item set الدار را را t3 o Finally resulting in the complete set of Frequent itemsetod & {egg, soup, sice sice, pasta, legg, soups, Eoggsice}, {soup, sice?