%0 Conference Paper
%1 bastide00miningminimal
%A Bastide, Y.
%A Pasquier, N.
%A Taouil, R.
%A Stumme, G.
%A Lakhal, L.
%B Computational Logic --- CL 2000 Proc. CL'00
%C Heidelberg
%D 2000
%E Lloyd, J.
%E Dahl, V.
%E Furbach, U.
%E Kerber, M.
%E Laus, K.-K.
%E Palamidessi, C.
%E Pereira, L.M.
%E Sagiv, Y.
%E Stuckey, P.J.
%I Springer
%K 2000 analys association closed concept condensed data discovery fca formal frequent itemsets kdd knowledge mining myown representation representations rule rules
%T Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf
%V 1861