edited by
1,780 views
0 votes
0 votes
With reference to implementation of different association mining algorithms, identify the correct statement:
(A) The FP growth method was usually better than the best implementation of the apriori algorithm
(B) Apriori algorithm is usually better than CHARM
(C) Apriori algorithm is good when the support required is low
(D) At very low support the number of frequent items becomes less
edited by

1 Answer

Best answer
2 votes
2 votes
Answer is A).

In apriori algorithm ===>

It occupies large space due to more candidates and hence execution time is more because of more generation of candidates so every time there is scanning , it leads to generation of çandidates.

In FP tree growth method ===>

It has no candidate generation , so requires low memory and hence scaaning is not done multiple times , hence low execution time

Both are used to find frequent patterns , but FP tree method is more eficient to find difficult,frequent patterns in  large database .
selected by

Related questions

0 votes
0 votes
0 answers
3
4 votes
4 votes
1 answer
4