%0 
%0 Conference Proceedings
%A Stumme, G.; Taouil, R.; Bastide, Y.; Pasquier, N. & Lakhal, L.
%D 2001
%T Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis
%E Baader, F.; Brewker, G. & Eiter, T.
%B KI 2001: Advances in Artificial Intelligence. KI 2001
%C Heidelberg
%I Springer
%V 2174
%6
%N 
%P 335-350
%& 
%Y 
%S LNAI
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Publications of Gerd Stumme
%3 inproceedings
%4 
%# 
%$ 
%F stumme01intelligent
%K concept, discovery, association, OntologyHandbook, bases, analysis, kdd, myown, rule, knowledge, closed, formal, rules, condensed, FCA, itemsets, 2001, fca, representations, mining
%X 
%Z 
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2001/KI01.pdf
%+
%^

%0 
%0 Conference Proceedings
%A Bastide, Y.; Taouil, R.; Pasquier, N.; Stumme, G. & Lakhal, L.
%D 2000
%T Levelwise Search of Frequent Patterns
%E 
%B Actes des 16ièmes Journées Bases de Données Avancées
%C France
%I Blois
%V 
%6
%N 
%P 307-322
%& 
%Y 
%S 
%7
%8 Oct 24-27
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Publications of Gerd Stumme
%3 inproceedings
%4 
%# 
%$ 
%F bastide00levelwise
%K algorithm, concept, discovery, algorithms, association, analysis, kdd, myown, frequent, data, knowledge, closed, formal, rules, condensed, itemsets, fca, 2000, representations, mining
%X 
%Z 
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2000/BDA00.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 concept, discovery, analys, association, OntologyHandbook, kdd, myown, frequent, rule, data, knowledge, closed, formal, rules, representation, condensed, FCA, itemsets, fca, 2000, representations, mining
%X 
%Z 
%U 
%+
%^

%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 concept, discovery, analys, association, kdd, myown, frequent, rule, data, knowledge, closed, formal, rules, representation, condensed, itemsets, fca, 2000, representations, mining
%X 
%Z 
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf
%+
%^