Association Rules Mining with Multiple Constraints
Guangyuan Li, Cao Dan-yang, Guo Jian-wei · Procedia Engineering · 2011
Association rules mining(ARM) is an important task in the field of data mining, mining frequent itemsets is a key step of many algorithms for ARM. In a very large dataset, rules generated may be very large, but some of them are useless to the users, to improve the effectiveness and efficiency of mining tasks, constraint-based mining enables users to concentrate on mining their interested association rules instead of the complete set of association rules. Most of previously proposed methods are mainly deal with a single constraint. In this paper, we present an algorithm for mining association rules with multiple constraints, the proposed algorithm simultaneously copes with two different kinds of constraints, it consists of three phases, first, the frequent 1-itemset are generated, second, we exploit the properties of the given constraints to prune search space or save constraint checking in the conditional databases. Third, for each itemset possible to satisfy the constraint, we generate its conditional database and perform the three phases in the conditional database recursively. Experimental results show that the proposed method outperform the revised FP-growth algorithm.