%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 
%3 inbook
%4 
%# 
%$ 
%F lakhal2005efficient
%K concept, book, discovery, 2005, association, l3s, analysis, kdd, myown, data, knowledge, closed, formal, rules, itegpub, condensed, itemsets, fca, representations, mining
%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 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 concept, book, discovery, 2005, association, l3s, analysis, kdd, myown, data, knowledge, closed, formal, rules, itegpub, condensed, itemsets, fca, representations, mining
%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 alpha
%3 article
%4 
%# 
%$ 
%F pasquier2005generating
%K concept, discovery, 2005, association, OntologyHandbook, l3s, analysis, kdd, itemset, myown, rule, data, knowledge, closed, formal, rules, itegpub, condensed, fca, sets, representations, mining
%X 
%Z 
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.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 concept, discovery, 2005, association, OntologyHandbook, l3s, analysis, kdd, itemset, myown, rule, data, knowledge, closed, formal, rules, itegpub, condensed, fca, sets, representations, mining
%X 
%Z 
%U http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf
%+
%^

%0 
%0 Journal Article
%A Stumme, Gerd; Taouil, Rafik; Bastide, Yves; Pasquier, Nicolas & Lakhal, Lotfi
%D 2002
%T Computing iceberg concept lattices with TITANIC
%E 
%B Data & Knowledge Engineering
%C 
%I Elsevier Science Publishers B. V.
%V 42
%6
%N 2
%P 189--222
%& 
%Y 
%S 
%7
%8 August
%9
%? 
%! 
%Z 
%@ 0169-023X
%(
%)
%*
%L
%M
%1 
%2 
%3 article
%4 
%# 
%$ 
%F stumme2002computing
%K titanic, concept, iceberg, fca, kdd, computing
%X We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data.
%Z 
%U http://portal.acm.org/citation.cfm?id=606457
%+
%^