The Community for Technology Leaders
2013 IEEE 29th International Conference on Data Engineering (ICDE) (2000)
San Diego, California
Feb. 28, 2000 to Mar. 3, 2000
ISSN: 1063-6382
ISBN: 0-7695-0506-6
pp: 307
Nicolas Pasquier , Universit? Clermont-Ferrand II
Yves Bastide , Universit? Clermont-Ferrand II
Lotfi Lakhal , Universit? Clermont-Ferrand II
Rafik Taouil , Universit? Clermont-Ferrand II
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.
Data Mining, Knowledge Discovery in Databases, Galois closure operator, frequent closed itemsets, bases for association rules
Nicolas Pasquier, Yves Bastide, Lotfi Lakhal, Rafik Taouil, "Mining Bases for Association Rules Using Closed Sets", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 307, 2000, doi:10.1109/ICDE.2000.839424
90 ms
(Ver 3.3 (11022016))