Lakhal, L. & Stumme, G.
(2005):
Efficient Mining of Association Rules Based on Formal Concept Analysis.
In: Formal Concept Analysis.
3626. Aufl./Vol..
Hrsg./Editors: Ganter, B.; Stumme, G. & Wille, R.
Verlag/Publisher: Springer Berlin Heidelberg,
Erscheinungsjahr/Year: 2005.
Seiten/Pages: 180-195.
[Volltext] [Kurzfassung] [BibTeX]
[Endnote]
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
@incollection{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},
series = {Lecture Notes in Computer Science},
publisher = {Springer Berlin Heidelberg},
year = {2005},
volume = {3626},
pages = {180-195},
url = {http://dx.doi.org/10.1007/11528784_10},
doi = {10.1007/11528784_10},
isbn = {978-3-540-27891-7},
keywords = {rules, association, survey, fca, literature},
abstract = {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 }
}
%0 = incollection
%A = Lakhal, Lotfi and Stumme, Gerd
%B = Formal Concept Analysis
%D = 2005
%I = Springer Berlin Heidelberg
%T = Efficient Mining of Association Rules Based on Formal Concept Analysis
%U = http://dx.doi.org/10.1007/11528784_10