An Efficient Constraint-Based Closed Set Mining Algorithm

We present a search algorithm for mining closed sets in high dimensional binary datasets. Our algorithm is designed for dense datasets, where the percentage of 1´s in the dataset is usually higher than 10%, and the total number of closed sets is much larger than the number of objects in the dataset. Our algorithm is memory efficient since, unlike many other closed set mining algorithms, it does not require all patterns mined so far to be kept in the memory. Optimization techniques are introduced in this paper, and we also present a parallel version of our algorithm.