Question

Since items have different values and expected frequencies of sale, it is desirable to use group-based minimum support thresholds set up by users. For example, one may set up a small min support for the group of diamonds but a rather large one for the group of shoes. Outline an Apriori-like algorithm that derive the set of frequent items efficiently in a transaction database.

Answer 1

age Acconding to the question ,'Consider a Sale 익 tonsach on co.th different Te gences An example about the daly need Transacthon table Tonba anion T D

ae vaioue measures on tuansachon tabl ) Contidence uppor No of transaction uncshich x appea6 for example,Onion 14 Supp (onion) > Confidente ··supp (xuy) Camp ( × → y) from the table,コs lot-the-hand a ction Containin g ontons6 potatoe

녘t P (xy) supp t)e Supp () from the ansacion lae potato being purchase Cohen ttem onion is purchased tloo Api algori-thm oork on transachon table emsel AU subsets at tequent ctem equent mus+ temtelall& a) for an Before beginin he p Oce Let us suppo?st -theshold to 507 bese-l re suppoㅟ -threshold" 50'/ .

Poge 4 the obove transocton o the ohove twandacthion table frequeney toble Frequentブ (N° 익 ㅢransac 1.ons) lem Onion Co 5 Potato ) Busge B) 냐 Beey Be) 2 뀌 from the above trequency table signiticant elements ore the fem guen Onion Potorto 5 HiAK

5 above table Ptepre sents +the single em ae purehased bythe ustomer 9 Possible the demsets Onion Potato Onion Burge Onion a efato Burge Pota-to ilk 90 » frequen table of pos&ble para frequen OP O M 나 P B

aqe 6 the 6.an, f ' eanㅢ ain įlemxd seoh.ch dhos emaOs threitemtha are Noto a set al three 'tems that ed ethe pu Burrge Onion B Onion otafo (OPB) Burge、 Potato On ' on otato tete Buer andPototo Hk Potato BuMilk t죠 ヤeguencブ 4 OP B PBIM

I tried my best to answer. I hope you understood.
If you have any doubts mention in comments. Please give me a upvote. Thank You..........