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.