6.5 Exercises
6.1 Suppose you have the set 
of all frequent closed itemsets on a data set D, as well as the support count for each frequent closed itemset. Describe an algorithm to determine whether a given itemset X is frequent or not, and the support of X if it is frequent.
6.2 An itemset X is called a generator on a data set D if there does not exist a proper sub-itemset 
such that 
. A generator X is a frequent generator if passes the minimum support ...
Get Data Mining: Concepts and Techniques, 3rd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
