Question

Most frequent pattern mining algorithms consider only distinct items in a transaction. However, multiple occurrences of an item in the same shopping basket, such as four cakes and three jugs of milk, can be important in transactional data analysis. How can one mine frequent itemsets efficiently considering multiple occurrences of items? Propose modifications to the well-known algorithms, such as Apriori and FP-growth, to adapt to such a situation.

Answer 1

Answer:

hello dear this is your answer

Explanation:

the answer is milk..apriori

hope it is helpful

don't forget to mark me brahinlist

Answer 2

Answer:

the answer is milk apirori