Fast and Memory Efficient Mining of Frequent Closed Itemsets

Provided by: Institute of Electrical & Electronic Engineers
Topic: Big Data
Format: PDF
In this paper, the authors present a new scalable algorithm for discovering closed frequent itemsets, a lossless and condensed representation of all the frequent itemsets that can be mined from a transactional database. Their algorithm exploits a divide-and-conquer approach and a bitwise vertical representation of the database and adopts a particular visit and partitioning strategy of the search space based on an original theoretical framework, which formalizes the problem of closed itemsets mining in detail. The algorithm adopts several optimizations aimed to save both space and time in computing itemset closures and their supports.

Find By Topic