Mining minimal non-redundant association rules using frequent closed itemsets

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 972-986

  Bastide, Yves ^a   Pasquier, Nicolas ^a   Taouil, Rafik ^a   Stumme, Gerd ^a,b   Lakhal, Lotfi ^a  

^a UNIVERSITÉ BLAISE PASCAL   (France)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FREQUENT CLOSED ITEMSETS; GALOIS CONNECTION; GENERATING SET; HIGH CONFIDENCE; REAL-LIFE DATABASE; SUPPORT AND CONFIDENCE;

LOGIC PROGRAMMING;

ASSOCIATION RULES;

EID: 84867817851     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_65     Document Type: Conference Paper

References (24)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. Proc. SIGMOD conf., pp 207-216, May 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. Proc. VLDB conf., pp 478-499, September 1994.
3. W. W. Armstrong. Dependency structures of data base relationships. Proc. IFIP congress, pp 580-583, August 1974.
4. R. J. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. Proc. ICDE conf., pp 188-197, March 1999.
5. R. J. Bayardo, and R. Agrawal. Mining the most interesting rules. Proc. KDD Conference, pp 145-154, August 1999.
6. C. Beeri, P. A. Bernstein. Computational problems related to the design of normal form relational schemas. Transactions on Database Systems, 4(1):30-59, 1979.
7. S. Brin,R. Motwani,C. Silverstein Beyond market baskets: Generalizing association rules to correlation. Proc. SIGMOD conf. 265-276 May, 1997.
8. V. Duquenne and J.-L. Guigues. Famille minimale d'implications informatives r-esultant d'un tableau de donn-ees binaires. Math-ematiques et Sciences Humaines, 24(95):5-18, 1986.
9. B. Ganter and R. Wille. Formal Co ncept Analysis: Mathematical foundations. Springer, 1999.
10. J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. Proc. VLDB conf., pp 420-431, September 1995.
11. D. Heckerman. Bayesian networks for knowledge discovery. Advances in Knowl-edge Discovery and Data Mining, pp 273-305, 1996.
12. M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo. Finding interesting rules from large sets of discovered association rules. Proc. CIKM conf., pp 401-407, November 1994.
13. M. Luxenburger. Implications partielles dans un contexte. Math-ematiques, Informatique et Sciences Humaines, 29(113):35-55, 1991.
14. D. Maier. Minimum covers in relational database model. Journal of the ACM, 27(4):664-674, 1980.
15. R. T. Ng, V. S. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained association rules. Proc. SIGMOD conf., pp 13-24, June 1998.
16. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Pruning close d itemset lattices for association rules. Proc. BDA conf., pp 177-196, Octobre 1998.
17. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25-46, 1999.
18. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. Proc. ICDT conf., LNCS 1540, pp 398-416, January 1999.
19. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Closed set based discovery of small covers for association rules. Proc. BDA conf., pp 361-381, Octobre 1999.
20. G. Piatetsky-Shapiro and C. J. Matheus. The interestingness of deviations. AAAI KDD workshop, pp 25-36, July 1994.
21. A. Silberschatz and A. Tuzhilin. What makes patterns interesting in knowledge disc overy systems. IEEE Transactions on Knowledge and Data Engineering, 8(6):970-974, December 1996.
22. C. Silverstein, S. Brin, and R. Motwani. Beyond market baskets: Generalizing association rules to dependence rules. Data Mining and Knowledge Discovery, 2(1):39-68, January 1998.
23. R. Srikant and R. Agrawal. Mining genera lized association rules. Proc. VLDB conf., pp 407-419, September 1995.
24. R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. Proc. KDD conf., pp 67-73, August 1997.