Computer Science/Data Structures and Algorithms
We address the problem of the usefulness and the relevance
of the set of discovered association rules. Using the frequent
closed itemset groundwork, we propose to generate
bases for association rules, that are non-redundant generating
sets for all association rules.
%0 Journal Article
%1 RafikTaouil&NicolasPasquier&YvesBastide_2000
%A Taouil, Rafik
%A Pasquier, Nicolas
%A Bastide, Yves
%A Lakhal, Lotfi
%D 2000
%K imported
%T Mining bases for association rules using closed sets
%X Computer Science/Data Structures and Algorithms
We address the problem of the usefulness and the relevance
of the set of discovered association rules. Using the frequent
closed itemset groundwork, we propose to generate
bases for association rules, that are non-redundant generating
sets for all association rules.
@article{RafikTaouil&NicolasPasquier&YvesBastide_2000,
abstract = {Computer Science/Data Structures and Algorithms
We address the problem of the usefulness and the relevance
of the set of discovered association rules. Using the frequent
closed itemset groundwork, we propose to generate
bases for association rules, that are non-redundant generating
sets for all association rules.},
added-at = {2013-08-04T13:35:40.000+0200},
author = {Taouil, Rafik and Pasquier, Nicolas and Bastide, Yves and Lakhal, Lotfi},
biburl = {https://www.bibsonomy.org/bibtex/2f3ffe14af7bfb0d59399b155532d7255/francesco.k},
interhash = {79d1b856a71fb329c7f260c846a74e91},
intrahash = {f3ffe14af7bfb0d59399b155532d7255},
keywords = {imported},
timestamp = {2013-08-04T14:07:28.000+0200},
title = {Mining bases for association rules using closed sets},
urldate = {15.07.2012},
year = 2000
}