%0 
%0 Book Section
%A Lakhal, Lotfi & Stumme, Gerd
%D 2005
%T Efficient Mining of Association Rules Based on Formal Concept Analysis
%E Ganter, Bernhard; Stumme, Gerd & Wille, Rudolf
%B Formal Concept Analysis: Foundations and Applications
%C Heidelberg
%I Springer
%V 3626
%6
%N 
%P 180-195
%& 
%Y 
%S LNAI
%7 
%8 
%9 
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Publications of Gerd Stumme
%3 inbook
%4 
%# 
%$ 
%F lakhal2005efficient
%K 2005, analysis, association, book, closed, concept, condensed, data, discovery, fca, formal, itegpub, itemsets, kdd, knowledge, l3s, mining, myown, representations, rules
%X Association rules are a popular knowledge discovery technique for
warehouse basket analysis. They indicate which items of the
warehouse are frequently bought together. The problem of association
rule mining has first been stated in 1993. Five years later, several
research groups discovered that this problem has a strong connection
to Formal Concept Analysis (FCA). In this survey, we will first
introduce some basic ideas of this connection along a specific
algorithm, \titanic, and show how FCA helps in reducing the number
of resulting rules without loss of information, before giving a
general overview over the history and state of the art of applying
FCA for association rule mining.
%Z 
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf
%+
%^

%0 
%0 Journal Article
%A Pasquier, Nicolas; Taouil, Rafik; Bastide, Yves; Stumme, Gerd & Lakhal, Lotfi
%D 2005
%T Generating a Condensed Representation for Association Rules
%E 
%B Journal Intelligent Information Systems (JIIS)
%C 
%I Kluwer Academic Publishers
%V 24
%6
%N 1
%P 29-60
%& 
%Y 
%S 
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Publications of Gerd Stumme
%3 article
%4 
%# 
%$ 
%F pasquier2005generating
%K 2005, OntologyHandbook, analysis, association, closed, concept, condensed, data, discovery, fca, formal, itegpub, itemset, kdd, knowledge, l3s, mining, myown, representations, rule, rules, sets
%X 
%Z 
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf
%+
%^

%0 
%0 Conference Proceedings
%A Stumme, G.
%D 2002
%T Efficient Data Mining Based on Formal Concept Analysis
%E Hameurlain, A.; Cicchetti, R. & Traunmüller, R.
%B Database and Expert Systems Applications. Proc. DEXA 2002
%C Heidelberg
%I Springer
%V 2453
%6
%N 
%P 534-546
%& 
%Y 
%S LNCS
%7
%8 
%9
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Publications of Gerd Stumme
%3 inproceedings
%4 
%# 
%$ 
%F stumme02efficient
%K 2002, association, closed, condensed, data, discovery, fca, itemsets, kdd, knowledge, mining, myown, representations, rules
%X 
%Z 
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2002/DEXA02.pdf
%+
%^

%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 2001, FCA, OntologyHandbook, analysis, association, bases, closed, concept, condensed, discovery, fca, formal, itemsets, kdd, knowledge, mining, myown, representations, rule, rules
%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 2000, algorithm, algorithms, analysis, association, closed, concept, condensed, data, discovery, fca, formal, frequent, itemsets, kdd, knowledge, mining, myown, representations, rules
%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 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 
%+
%^

%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 Report
%A Stumme, G.
%D 1999
%T Conceptual Knowledge Discovery with Frequent Concept Lattices
%E 
%B 
%C 
%I TU Darmstadt
%V 
%6
%N 
%P 
%& 
%Y 
%S 
%7
%8 
%9 {FB}4-{P}reprint 2043
%? 
%! 
%Z 
%@ 
%(
%)
%*
%L
%M
%1 
%2 Publications of Gerd Stumme
%3 techreport
%4 
%# 
%$ 
%F stumme99conceptualknowledge
%K 1999, analysis, association, closed, concept, condensed, data, discovery, fca, formal, frequent, iceberg, itemsets, kdd, knowledge, lattices, mining, myown, representations, rule, rules
%X 
%Z 
%U http://www.kde.cs.uni-kassel.de/stumme/papers/1999/P2043.pdf
%+
%^