Mining Bases for Association Rules Using Closed Sets R. Taouil, N. Pasquier, Y. Bastide, and L. Lakhal   View Paper (PDF)   Return to OLAP, DW, and Data Mining Abstract We address the problem of the usefulness and the relevance of the set of discovered association rules. Using the frequent closed item set groundwork, we propose to generate bases for association rules, that are non-redundant generating sets for all association rules. Keywords: Data Mining, Knowledge Discovery in Databases, Galois closure operator, frequent closed itemsets, bases for association rules DiSC'01 Copyright ©2002 ACM Inc.