|Title:||Mining association rules with multi-dimensional constraints||Authors:||Lee A.J.T.
|Keywords:||Association rule;Constraint-based mining;Data mining||Issue Date:||2006||Journal Volume:||79||Journal Issue:||1||Start page/Pages:||79-92||Source:||Journal of Systems and Software||Abstract:||
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. Previously proposed methods are mainly contributed to handling a single constraint and only consider the constraints which are characterized by a single attribute value. In this paper, we propose an approach to mine association rules with multiple constraints constructed by multi-dimensional attribute values. Our proposed approach basically consists of three phases. First, we collect the frequent items and prune infrequent items according to the Apriori property. 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. Our proposed algorithms can exploit the properties of constraints to prune search space or save constraint checking. Therefore, our proposed algorithm is more efficient than the revised FP-growth and FIC algorithms. ? 2005 Elsevier Inc. All rights reserved.
|Appears in Collections:||資訊管理學系|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.