%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 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 alpha
%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
%+
%^