An Approach for Mining Association Rules Intersected with Constraint Itemsets
When the number of association rules extracted from datasets is very large, using them becomes too complicated to the users. Thus, it is important to obtain a small set of association rules in direction to users. The paper investigates the problem of discovering the set of association rules intersected with constraint itemsets. Since the constraints usually change, we start the mining from the lattice of closed itemsets and their generators, mined only one time, instead of from the dataset. We first partition the rule set with constraint into disjoint classes of the rules having the same closures. Then, each class is mined independently. Using the set operators on the closed itemsets and their generators, we show the explicit representations of the rules intersected with constraints in two shapes: rules with confidence of equal to 1 and those with confidence of less than 1. Due to those representations, the algorithm IntARS-OurApp is proposed for mining quickly the rules without checking rules directly with constraints. The experiments proved its efficiency.
Unable to display preview. Download preview PDF.
- 1.Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceeding of the 20th International Conference on Very Large Data Bases, pp. 478–499 (1994)Google Scholar
- 2.Anh, T., Hai, D., Tin, T., Bac, L.: Efficient Algorithms for Mining Frequent Itemsets with Constraint. In: Proceedings of the Third International Conference on Knowledge and Systems Engineering, pp. 19–25 (2011)Google Scholar
- 5.Bonchi, F., Lucchese, C.: On closed constrained frequent pattern mining. In: Proc. IEEE ICDM 2004 (2004)Google Scholar
- 10.Srikant, R., Vu, Q., Agrawal, R.: Mining association rules with item constraints. In: Proceeding KDD 1997, pp. 67–73 (1997)Google Scholar
- 11.Zaki, M.J.: Mining non-redundant association rules. Data Mining and Knowledge Discovery (9), 223–248 (2004)Google Scholar