Efficient Mining of Association Rules Based on Formal Concept Analysis.
2005.
Lotfi Lakhal und Gerd Stumme.
[doi]
[Kurzfassung]
[BibTeX]
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, 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.
Efficient Mining of Association Rules Based on Formal Concept Analysis.
2005.
Lotfi Lakhal und Gerd Stumme.
[doi]
[Kurzfassung]
[BibTeX]
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, 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.
Pascal: un alogorithme d'extraction des motifs fréquents.
Technique et Science Informatiques (TSI), 21(1):65-95, 2002.
Y. Bastide, R. Taouil, N. Pasquier, G. Stumme und L. Lakhal.
[doi]
[BibTeX]
Computing Iceberg Concept Lattices with Titanic.
J. Data and KnowledgeEngineering (DKE), 42(2):189-222, 2002.
G. Stumme, R. Taouil, Y. Bastide, N. Pasqier und L. Lakhal.
[doi]
[BibTeX]
Efficient Data Mining Based on Formal Concept Analysis.
In: A. Hameurlain, R. Cicchetti und R. Traunmüller
(Herausgeber):
Database and Expert Systems Applications. Proc. DEXA 2002, Band 2453, Reihe LNCS, Seiten 534-546.
Springer, Heidelberg, 2002.
G. Stumme.
[doi]
[BibTeX]
Conceptual Clustering with Iceberg Concept Lattices.
In: R. Klinkenberg, S. Rüping, A. Fick, N. Henze, C. Herzog, R. Molitor und O. Schröder
(Herausgeber):
Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01).
Universität Dortmund 763, 2001.
G. Stumme, R. Taouil, Y. Bastide und L. Lakhal.
[doi]
[BibTeX]
Conceptual Clustering with Iceberg Concept Lattices.
In: R. Klinkenberg, S. Rüping, A. Fick, N. Henze, C. Herzog, R. Molitor und O. Schröder
(Herausgeber):
Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01).
Universität Dortmund 763, 2001.
G. Stumme, R. Taouil, Y. Bastide und L. Lakhal.
[doi]
[BibTeX]
Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis.
In: F. Baader, G. Brewker und T. Eiter
(Herausgeber):
KI 2001: Advances in Artificial Intelligence. KI 2001, Band 2174, Reihe LNAI, Seiten 335-350.
Springer, Heidelberg, 2001.
G. Stumme, R. Taouil, Y. Bastide, N. Pasquier und L. Lakhal.
[doi]
[BibTeX]
Levelwise Search of Frequent Patterns.
In:
Actes des 16ièmes Journées Bases de Données Avancées, Seiten 307-322.
Blois, France, 2000.
Y. Bastide, R. Taouil, N. Pasquier, G. Stumme und L. Lakhal.
[doi]
[BibTeX]
Mining Frequent Patterns with Counting Inference..
SIGKDD Explorations, Special Issue on Scalable Algorithms, 2(2):71-80, 2000.
Y. Bastide, R. Taouil, N. Pasquier, G. Stumme und L. Lakhal.
[BibTeX]
Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets.
In: J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Laus, C. Palamidessi, L. Pereira, Y. Sagiv und P. Stuckey
(Herausgeber):
Computational Logic -- CL 2000 Proc. CL'00, Band 1861, Reihe LNAI.
Springer, Heidelberg, 2000.
Y. Bastide, N. Pasquier, R. Taouil, G. Stumme und L. Lakhal.
[doi]
[BibTeX]
Approximation of Frequency Queris by Means of Free-Sets.
In:
Principles of Data Mining and Knowledge Discovery, Seiten 75-85.
2000.
Jean-Francois Boulicaut, Artur Bykowski und Christophe Rigotti.
[doi]
[BibTeX]
Fast Computation of Concept Lattices Using Data Mining Techniques.
In: M. Bouzeghoub, M. Klusch, W. Nutt und U. Sattler
(Herausgeber):
Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases.
2000.
http://ceur-ws.org/Vol-29. Part of testumme02computing
G. Stumme, R. Taouil, Y. Bastide, N. Pasquier und L. Lakhal.
[doi]
[BibTeX]
Conceptual Knowledge Discovery with Frequent Concept Lattices.
FB4-Preprint 2043, TU Darmstadt, 1999.
G. Stumme.
[doi]
[BibTeX]