To enhance your knowledge about this chapter, here are some practice questions that'll let you understand the concepts better:
Write an R program to find how many unique items' names are contained in the given sample market basket transaction file. Map each item's name to a unique integer ID. Find out all the closed frequent itemsets. Find out all the maximal frequent itemsets and their support count. Set a support count threshold to various values yourself.
Write an R program to implement the A-PrioriTid algorithm.