DualMiner: A Dual-Pruning Algorithm for Itemsets with Constraints

    loading  Checking for direct PDF access through Ovid


Recently, constraint-based mining of itemsets for questions like “find all frequent itemsets whose total price is at least $50” has attracted much attention. Two classes of constraints, monotone and antimonotone, have been very useful in this area. There exist algorithms that efficiently take advantage of either one of these two classes, but no previous algorithms can efficiently handle both types of constraints simultaneously. In this paper, we present DualMiner, the first algorithm that efficiently prunes its search space using both monotone and antimonotone constraints. We complement a theoretical analysis and proof of correctness of DualMiner with an experimental study that shows the efficacy of DualMiner compared to previous work.

    loading  Loading Related Articles