Dualminer: A dual-pruning algorithm for itemsets with constraints
Proceedings of the eighth ACM SIGKDD international conference on Knowledge …, 2002•dl.acm.org
Constraint-based mining of itemsets for questions such as" find all frequent itemsets where
the total price is at least $50" has received much attention recently. Two classes of
constraints, monotone and antimonotone, have been identified as very useful. There are
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 the first algorithm (called DualMiner) that uses both monotone and antimonotone …
the total price is at least $50" has received much attention recently. Two classes of
constraints, monotone and antimonotone, have been identified as very useful. There are
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 the first algorithm (called DualMiner) that uses both monotone and antimonotone …
Constraint-based mining of itemsets for questions such as "find all frequent itemsets where the total price is at least $50" has received much attention recently. Two classes of constraints, monotone and antimonotone, have been identified as very useful. There are 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 the first algorithm (called DualMiner) that uses both monotone and antimonotone constraints to prune its search space. 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.
ACM Digital Library