Concise representations for approximate association rules

Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

Volumn , Issue , 2008, Pages 94-101

  Xu, Yue ^a   Li, Yuefeng ^a   Shaw, Gavin ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Association rule mining; Certainty factor; Closed itemsets; Generator; Redundant association rules

Indexed keywords

ASSOCIATION RULE MINING; CERTAINTY FACTOR; CLOSED ITEMSETS; GENERATOR; REDUNDANT ASSOCIATION RULES;

ASSOCIATION RULES; CONTROL THEORY; CYBERNETICS; MINING; QUALITY ASSURANCE; REDUNDANCY;

ASSOCIATIVE PROCESSING;

EID: 69949183650     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2008.4811257     Document Type: Conference Paper

References (18)

1. 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.
2. M. J. A. Berry and G. S. Linoff. Data Mining Techniques for Marketing, Sales and Customer Support. John Wiley and Sons, 1997.
3. 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.
4. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. pages 74-85. Springer, 2002.
5. B. Ganter and R. Wille. Formal Concept Analysis: Mathematical Foundations. Springer-Verlag, 1999.
6. B. Goethals, J. Muhonen, and H. Toivonen. Mining non-derivable association rules. In Proceedings of the SIAM International Conference on Data Mining, pages 239-249, 2005.
7. 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.
8. J. Han, L. V. S. Lakshmanan, and R. T. Ng. Constraint-based multidimensional data mining. IEEE Computer, 32(8):46-50, 1999.
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. 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.
11. 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.
12. N. Pasquier, R. Taouil, Y. Bastide, G. Stumme, and L. Lakhal. Generating a condensed representation for association rules. Journal of Intelligent Information Systems, 24(1):29-60, 2005.
13. E. H. Shortliffe and B. G. Buchanan. A model of inexact reasoning in medicine. Mathematical Biosciences, 23(3/4):351-379, 1975.
14. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In Proceedings of the KDD Conference, pages 67-73, 1997.
15. R. Wille. Restructuring lattices theory: An approach based on hierarchies of concepts. I. Rival (editor), Ordered sets. Dordrecht-Boston, 1982.
16. Y. Xu and Y. Li. Generating concise association rules. In Proceedings of the 16th ACM Conference on Conference on Information and Knowledge Management (CIKM07), pages 781-790, 2007.
17. M. J. Zaki. Generating non-redundent association rules. In Proceedings of the KDD Conference, pages 34-43, 2000.
18. M. J. Zaki. Mining non-redundant association rules. Data Mining and Knowledge Discovery, 9:223-248, 2004.