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