6.5 Exercises

6.1 Suppose you have the set image 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 image such that image. A generator X is a frequent generator if passes the minimum support ...

Get Data Mining: Concepts and Techniques, 3rd Edition now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.