%0 
%0 Conference Proceedings
%A Bastide, Y.; Pasquier, N.; Taouil, R.; Stumme, G. & Lakhal, L.
%D 2000
%T Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
%E Lloyd, J.; Dahl, V.; Furbach, U.; Kerber, M.; Laus, K.-K.; Palamidessi, C.; Pereira, L.M.; Sagiv, Y. & Stuckey, P.J.
%B Computational Logic --- CL 2000 Proc. CL'00
%C Heidelberg
%I Springer
%V 1861
%6
%N 
%P 
%& 
%Y 
%S LNAI
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Publications of Gerd Stumme
%3 inproceedings
%4 
%# 
%$ 
%F bastide00miningminimal
%K 2000, analys, association, closed, concept, condensed, data, discovery, fca, formal, frequent, itemsets, kdd, knowledge, mining, myown, representation, representations, rule, rules
%X 
%Z 
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf
%+
%^

%0 
%0 Journal Article
%A Bastide, Y.; Taouil, R.; Pasquier, N.; Stumme, G. & Lakhal, L.
%D 2000
%T Mining Frequent Patterns with Counting Inference.
%E 
%B SIGKDD Explorations, Special Issue on Scalable Algorithms
%C 
%I 
%V 2
%6
%N 2
%P 71-80
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Publications of Gerd Stumme
%3 article
%4 
%# 
%$ 
%F bastide00miningfrequent
%K 2000, FCA, OntologyHandbook, analys, association, closed, concept, condensed, data, discovery, fca, formal, frequent, itemsets, kdd, knowledge, mining, myown, representation, representations, rule, rules
%X 
%Z 
%U 
%+
%^