Question 1 [70 marks] You are givea the traneictional dafa set D shown in the table below. The
data set D las ten transactions. Let the minimum support (min map) coant be 2 Find all frequent
itemsets in D using a. [20 marks] the borizontal Apriori algorithm. PLEASE TURN TO THE NEXT
PAGE b. [20 marks ] the vertical Apriori algorithm given below. Algorithm
Vericatipriori(Transactions: D, amin_smp) F1= (All frequcat 1 -itemsets) Comstruct vertical fid lists
of each frequent item k=1 while Fk is not empty do Generate Ci+1 by joining itemset-pairs in Fi
Prune itemsets from Ci+1 that are iafrequent Gencrate rid lias of each caadidate ifemset in Che by
inscrsecting ad lists of the itenset-poir in F that was used to create the candidate itemset
Determine supports of itemsets in Cior using lengths of their tid lists Fi+1 - Frequent itermiets of Ci
+1 together with their tid lists k=k+1endreturn(Vk=1kFi).Frequont C. [30 marks] the FP-growth
algorithm, where the FP-tree is contructed using the onder L {fW}=7,{B}6,(R):6,(G),2,(O)/2}..
Question 1 70 marks You are givea the traneictional dafa s.pdf
1. Question 1 [70 marks] You are givea the traneictional dafa set D shown in the table below. The
data set D las ten transactions. Let the minimum support (min map) coant be 2 Find all frequent
itemsets in D using a. [20 marks] the borizontal Apriori algorithm. PLEASE TURN TO THE NEXT
PAGE b. [20 marks ] the vertical Apriori algorithm given below. Algorithm
Vericatipriori(Transactions: D, amin_smp) F1= (All frequcat 1 -itemsets) Comstruct vertical fid lists
of each frequent item k=1 while Fk is not empty do Generate Ci+1 by joining itemset-pairs in Fi
Prune itemsets from Ci+1 that are iafrequent Gencrate rid lias of each caadidate ifemset in Che by
inscrsecting ad lists of the itenset-poir in F that was used to create the candidate itemset
Determine supports of itemsets in Cior using lengths of their tid lists Fi+1 - Frequent itermiets of Ci
+1 together with their tid lists k=k+1endreturn(Vk=1kFi).Frequont C. [30 marks] the FP-growth
algorithm, where the FP-tree is contructed using the onder L {fW}=7,{B}6,(R):6,(G),2,(O)/2}.
![Question 1 [70 marks] You are givea the traneictional dafa set D shown in the table below. The
data set D las ten transactions. Let the minimum support (min map) coant be 2 Find all frequent
itemsets in D using a. [20 marks] the borizontal Apriori algorithm. PLEASE TURN TO THE NEXT
PAGE b. [20 marks ] the vertical Apriori algorithm given below. Algorithm
Vericatipriori(Transactions: D, amin_smp) F1= (All frequcat 1 -itemsets) Comstruct vertical fid lists
of each frequent item k=1 while Fk is not empty do Generate Ci+1 by joining itemset-pairs in Fi
Prune itemsets from Ci+1 that are iafrequent Gencrate rid lias of each caadidate ifemset in Che by
inscrsecting ad lists of the itenset-poir in F that was used to create the candidate itemset
Determine supports of itemsets in Cior using lengths of their tid lists Fi+1 - Frequent itermiets of Ci
+1 together with their tid lists k=k+1endreturn(Vk=1kFi).Frequont C. [30 marks] the FP-growth
algorithm, where the FP-tree is contructed using the onder L {fW}=7,{B}6,(R):6,(G),2,(O)/2}.](https://image.slidesharecdn.com/question170marksyouaregiveathetraneictionaldafas-230320122744-e230df55/85/Question-1-70-marks-You-are-givea-the-traneictional-dafa-s-pdf-1-320.jpg)
