@inbook{lakhal2005efficient, author = {Lakhal, Lotfi and Stumme, Gerd}, title = {Efficient Mining of Association Rules Based on Formal Concept Analysis}, editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf}, booktitle = {Formal Concept Analysis: Foundations and Applications}, series = {LNAI}, publisher = {Springer}, address = {Heidelberg}, year = {2005}, volume = {3626}, pages = {180-195}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf}, keywords = {2005, analysis, association, book, closed, concept, condensed, data, discovery, fca, formal, itegpub, itemsets, kdd, knowledge, l3s, mining, myown, representations, rules}, abstract = {Association rules are a popular knowledge discovery technique for
rehouse basket analysis. They indicate which items of the
rehouse are frequently bought together. The problem of association
le mining has first been stated in 1993. Five years later, several
search groups discovered that this problem has a strong connection
Formal Concept Analysis (FCA). In this survey, we will first
troduce some basic ideas of this connection along a specific
gorithm, and show how FCA helps in reducing the number
resulting rules without loss of information, before giving a
neral overview over the history and state of the art of applying
A for association rule mining.} }