Mining non-redundant association rules based on concise bases

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 21, Issue 4, 2007, Pages 659-675

  Yue, Xu ^a   Yuefeng, Li ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Association rules; Centainty factors; Closed itemsets; Frequent itemsets; Generators; Redundant rules

Indexed keywords

ASSOCIATION RULES; DATA REDUCTION; PROBLEM SOLVING; REDUNDANCY;

CENTAINTY FACTORS; CLOSED ITEMSETS; FREQUENT ITEMSETS; REDUNDANT RULES;

DATA MINING;

EID: 34250816491     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001407005600     Document Type: Article

References (19)

1. R. Agrawal, T. Imielinski and A. N. Swami, Mining association rules between sets of items in large databases, Proc. ACM SIGMOD (1993), pp. 207-216.
2. R. Agrawal and R. Srikant, Fast algorithms for mining association rules, Proc. 20th Int. Conf. Very Large Data Bases (1994), pp. 487-499.
3. R. J. Bayardo, Efficiently mining long patterns from databases, Proc. ACM SIGMOD Conf. (1998), pp. 85-93.
4. R. J. Bayardo, R. Agrawal and D. Gunopulos, Constraint-based rule mining in large, dense databases, Data Min. Knowl. Discov. 4 (2000) 217-240.
5. S. Brin, R. Motwani, J. D. Ullman and S. Tsur, Dynamic itemset counting and implication rules for market basket data, Proc. ACM SIGMOD Conf. (1997), pp. 255-264.
6. B. Ganter and R. Wille, Formal Concept Analysis: Mathematical Foundations (Springer-Verlag, Berlin, 1999).
7. J. Han and Y. Fu, Mining multiple-level association rules in large databases, IEEE Trans. Knowl Data Eng. 11 (2000) 798-804.
8. M. Kryszkiewicz, H. Rybinski and M. Gajek, Dataless transitions between concise representations of frequent patterns, J. Intell. Inform. Syst. 22(1) (2004) 41-70.
9. K. V. Ng and B. Abramson, Uncertainty management in expert systems, IEEE Expert 5(2) (1990) 29-47.
10. R. T. Ng, V. S. Lakshmanan, J. Han and A. Pang, Exploratory mining and pruning otimizations of constrained association rules, Proc. ACM SIGMOD Conf. (1998), pp. 13-24.
11. N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, Discovering frequent closed itemsets for association rules, Proc. 7th ICDT Conf. (1999), pp. 398-416.
12. N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, Efficient mining of association rultes using closed itemset lattices, Inform. Syst. 24(1) (1999) 25-46.
13. N. Pasquier, R. Taouil, Y. Bastide, G. Stumme and L. Lakhal, Generating a condensed representation for association rules, J. Intell. Inform. Syst. 24(1) (2005) 29-60.
14. J. Pei, J. Han and R. Mao, CLOSET: an efficient algorithm for mining frequent closed itemsets, Proc. DMKD Workshop on Research Issues in Data Mining and Knowledge Discovery (2000), pp. 21-30.
15. E. H. Shortliffe and B. G. Buchanan, A model of inexact reasoning in medicine, Math. Biosci. 23(3/4) (1975) 351-379.
16. R. Srikant, Q. Vu and R. Agrawal, Mining association rules with item constraints, Proc. KDD Conf. (1997), pp. 67-73.
17. R. Wille, Restructuring lattices theory: an approach based on hierarchies of concepts, Ordered Sets, ed. I. Rival (Dordrecht Boston, 1982), pp. 445-470.
18. M. J. Zaki, Generating nonredundant association rules, Proc. KDD Conf. (2000), pp. 34-43.
19. M. J. Zaki, Mining non-redundant association rules, Data Min. Knowl. Discov. 9 (2004) 223-248.