%0 Conference Paper %1 bastide2000 %A Bastide, Yves %A Pasquier, Nicolas %A Taouil, Rafik %A Stumme, Gerd %A Lakhal, Lotfi %B Computational Logic - CL 2000 %D 2000 %I Springer %K associationRules closedSetMining dataMining patternMining %P 972--986 %T Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets %U http://dx.doi.org/10.1007/3-540-44957-4_65 %X The problem of the relevance and the usefulness of extracted association rules is of primary importance because, in the majority of cases, real-life databases lead to several thousands association rules with high confidence and among which are many redundancies.Using the closure of the Galois connection, we define two new bases for association rules which union is a generating setfor all valid association rules with support and confidence. These bases are characterized using frequent closed itemsetsand their generators; they consist of the non-redundant exact and approximate association rules having minimal antecedentsand maximal consequents, i.e. the most relevant association rules. Algorithms for extracting these bases are presented andresults of experiments carried out on real-life databases show that the proposed bases are useful, and that their generationis not time consuming.

@inproceedings{bastide2000, abstract = {The problem of the relevance and the usefulness of extracted association rules is of primary importance because, in the majority of cases, real-life databases lead to several thousands association rules with high confidence and among which are many redundancies.Using the closure of the Galois connection, we define two new bases for association rules which union is a generating setfor all valid association rules with support and confidence. These bases are characterized using frequent closed itemsetsand their generators; they consist of the non-redundant exact and approximate association rules having minimal antecedentsand maximal consequents, i.e. the most relevant association rules. Algorithms for extracting these bases are presented andresults of experiments carried out on real-life databases show that the proposed bases are useful, and that their generationis not time consuming.}, added-at = {2009-05-24T20:03:40.000+0200}, author = {Bastide, Yves and Pasquier, Nicolas and Taouil, Rafik and Stumme, Gerd and Lakhal, Lotfi}, biburl = {https://www.bibsonomy.org/bibtex/25a44253a641668153120a8abcbbf47df/mboley}, booktitle = {Computational Logic - CL 2000}, description = {SpringerLink - Buchkapitel}, interhash = {dc10d0ad3c40463f049ac775cb250f3d}, intrahash = {5a44253a641668153120a8abcbbf47df}, keywords = {associationRules closedSetMining dataMining patternMining}, pages = {972--986}, publisher = {Springer}, timestamp = {2009-07-28T11:21:13.000+0200}, title = {Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets}, url = {http://dx.doi.org/10.1007/3-540-44957-4_65}, year = 2000 }