Generating concise association rules

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2007, Pages 781-789

  Xu, Yue ^a   Li, Yuefeng ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Closed itemsets; Generators; Redundant association rules

Indexed keywords

ASSOCIATION RULE MININGS; CLOSED ITEMSETS; CONDENSED REPRESENTATIONS; GENERATORS; KNOWLEDGE DISCOVERIES; LOSSLESS; MIN MAXES; NON-REDUNDANT RULES; REDUNDANT ASSOCIATION RULES; REDUNDANT RULES; RULE SETS;

ASSOCIATION RULES; KNOWLEDGE MANAGEMENT; QUALITY ASSURANCE; REDUNDANCY;

ASSOCIATIVE PROCESSING;

EID: 57649214044     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1321440.1321549     Document Type: Conference Paper

References (21)

1. R. Agrawal, T. Imielinski, and A. N. Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pages 207-216, 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on very large data bases, pages 487-499, 1994.
3. R. J. Bayardo. Efficiently mining long patterns from databases. In Proceedings of the 1998 ACM SIGMOD Conference, pages 85-93, 1998.
4. R. J. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. Data Mining and Knowledge Discovery, 4:217-240, 2000.
5. M. J. A. Berry and G. S. Linoff. Data Mining Techniques for Marketing, Sales and Customer Support. John Wiley and Sons, 1997.
6. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proceedings of the 1997 ACM SIGMOD Conference, pages 255-264, 1997.
7. B. Ganter and R. Wille. Formal Concept Analysis: Mathematical Foundations. Springer-Verlag, 1999.
8. J. Han and Y. Fu. Mining multiple-level association rules in large databases. IEEE Transactions on Knowledge and Data Engineering, 11:798-804, 5 2000. [9] J. Han and J. Pei. Mining frequent patterns by pattern-growth: methodology and implications. ACM SIGKDD Explorations Newsletter, 2(2):14-20, 2000.
9. M. Kryszkiewicz, H. Rybinski, and M. Gajek. Dataless transitions between concise representations of frequent patterns. Journal of Intelligent Information Systems, 22(1):41-70, 2004.
10. K. Ng and B. Abramson. Uncertainty management in expert systems. IEEE Expert, 5(2):29-47, 1990.
11. R. T. Ng, V. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning otimizations of constrained association rules. In Proceedings of the SIGMOD conference, pages 13-24, 1998.
12. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proceedings of the 7th ICDT conference, pages 398-416, 1999.
13. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rultes using closed itemset lattices. Information Systems, 24(1):25-46, 1999.
14. N. Pasquier, R. Taouil, Y. Bastide, G. Stumme, and L. Lakhal. Generating a condensed representation for association rules. Journal ofIntelligent Information Systems, 24(1):29-60, 2005.
15. J. Pei, J. Han, and R. Mao. Closet: An efficient algorithm for mining frequent closed itemsets. In Proceedings ofthe DMKDWorkshop on Research Issues in Data Mining and Knowledge Discovery, pages 21-30, 2000.
16. E. H. Shortliffe and B. G. Buchanan. A model of inexact reasoning in medicine. Mathematical Biosciences, 23(3/4):351-379, 1975.
17. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In Proceedings ofthe KDD Conference, pages 67-73, 1997
18. R. Wille. Restructuring lattices theory: An approach based on hierarchies of concepts. I. Rival (editor), Ordered sets. Dordrecht-Boston, 1982.
19. M. J. Zaki. Generating non-redundent association rules. In Proceedings ofthe KDD Conference, pages 34-43, 2000.
20. M. J. Zaki. Mining non-redundant association rules. Data Mining and Knowledge Discovery, 9:223-248, 2004.
21. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proceedings of the 3rd KDD conference, pages 283-286, 1997.