Bastide, Y.; Pasquier, N.; Taouil, R.; Stumme, G. & Lakhal, L.
(2000):
Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets.
In: Computational Logic -- CL 2000 Proc. CL'00,
Heidelberg.
[Volltext]
[BibTeX][Endnote]
@inproceedings{bastide00miningminimal,
author = {Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.},
title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets},
editor = {Lloyd, J. and Dahl, V. and Furbach, U. and Kerber, M. and Laus, K.-K. and Palamidessi, C. and Pereira, L.M. and Sagiv, Y. and Stuckey, P.J.},
booktitle = {Computational Logic --- CL 2000 Proc. CL'00},
series = {LNAI},
publisher = {Springer},
address = {Heidelberg},
year = {2000},
volume = {1861},
url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf},
keywords = {2000, analys, association, closed, concept, condensed, data, discovery, fca, formal, frequent, itemsets, kdd, knowledge, mining, myown, representation, representations, rule, rules}
}
%0 = inproceedings
%A = Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.
%B = Computational Logic --- CL 2000 Proc. CL'00
%C = Heidelberg
%D = 2000
%I = Springer
%T = Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
%U = http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf