Lakhal, Lotfi and Stumme, Gerd
Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf
Efficient Mining of Association Rules Based on Formal Concept Analysis
Formal Concept Analysis: Foundations and Applications
Springer
2005
3626
180-195
LNAI
Heidelberg
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.
http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf
2005, analysis, association, book, closed, concept, condensed, data, discovery, fca, formal, itegpub, itemsets, kdd, knowledge, l3s, mining, myown, representations, rules
Publications of Gerd Stumme
Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi
Generating a Condensed Representation for Association Rules
Journal Intelligent Information Systems (JIIS)
Kluwer Academic Publishers
2005
24
29-60
1
http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf
2005, OntologyHandbook, analysis, association, closed, concept, condensed, data, discovery, fca, formal, itegpub, itemset, kdd, knowledge, l3s, mining, myown, representations, rule, rules, sets
Publications of Gerd Stumme
Stumme, G.
Hameurlain, A. and Cicchetti, R. and Traunmüller, R.
Efficient Data Mining Based on Formal Concept Analysis
Database and Expert Systems Applications. Proc. DEXA 2002
Springer
2002
2453
534-546
LNCS
Heidelberg
http://www.kde.cs.uni-kassel.de/stumme/papers/2002/DEXA02.pdf
2002, association, closed, condensed, data, discovery, fca, itemsets, kdd, knowledge, mining, myown, representations, rules
Publications of Gerd Stumme
Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.
Baader, F. and Brewker, G. and Eiter, T.
Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis
KI 2001: Advances in Artificial Intelligence. KI 2001
Springer
2001
2174
335-350
LNAI
Heidelberg
http://www.kde.cs.uni-kassel.de/stumme/papers/2001/KI01.pdf
2001, FCA, OntologyHandbook, analysis, association, bases, closed, concept, condensed, discovery, fca, formal, itemsets, kdd, knowledge, mining, myown, representations, rule, rules
Publications of Gerd Stumme
Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.
Levelwise Search of Frequent Patterns
Actes des 16ièmes Journées Bases de Données Avancées
Blois
2000
Oct 24-27
307-322
France
http://www.kde.cs.uni-kassel.de/stumme/papers/2000/BDA00.pdf
2000, algorithm, algorithms, analysis, association, closed, concept, condensed, data, discovery, fca, formal, frequent, itemsets, kdd, knowledge, mining, myown, representations, rules
Publications of Gerd Stumme
Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.
Mining Frequent Patterns with Counting Inference.
SIGKDD Explorations, Special Issue on Scalable Algorithms
2000
2
71-80
2
2000, FCA, OntologyHandbook, analys, association, closed, concept, condensed, data, discovery, fca, formal, frequent, itemsets, kdd, knowledge, mining, myown, representation, representations, rule, rules
Publications of Gerd Stumme
Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.
Lloyd, J. and Dahl, V. and Furbach, U. and Kerber, M. and Laus, K.-K. and Palamidessi, C. and Pereira, L.M. and Sagiv, Y. and Stuckey, P.J.
Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets
Computational Logic –- CL 2000 Proc. CL'00
Springer
2000
1861
LNAI
Heidelberg
http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf
2000, analys, association, closed, concept, condensed, data, discovery, fca, formal, frequent, itemsets, kdd, knowledge, mining, myown, representation, representations, rule, rules
Publications of Gerd Stumme
Boulicaut, Jean-Francois and Bykowski, Artur and Rigotti, Christophe
Approximation of Frequency Queris by Means of Free-Sets
Principles of Data Mining and Knowledge Discovery
2000
75-85
citeseer.ist.psu.edu/boulicaut00approximation.html
Analysis, Concept, Formal, closed, dm, fca, free, itemset, itemsets, kdd, mining, sets
Approximation of Frequency Queries By Means of Free-Sets - Boulicaut, Bykowski, Rigotti (ResearchIndex)
Stumme, G.
Conceptual Knowledge Discovery with Frequent Concept Lattices
1999
TU Darmstadt
http://www.kde.cs.uni-kassel.de/stumme/papers/1999/P2043.pdf
FB4-Preprint 2043
1999, analysis, association, closed, concept, condensed, data, discovery, fca, formal, frequent, iceberg, itemsets, kdd, knowledge, lattices, mining, myown, representations, rule, rules
Publications of Gerd Stumme
Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi
Bouzeghoub, Mokrane
Pruning closed itemset lattices for associations rules.
Bases de Donn�es Avanc�es
1998
http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98
conf/bda/1998
FCA, OntologyHandbook, analysis, association, closed, concept, fca, formal, itemset, mining, rules
Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi
Bouzeghoub, Mokrane
Pruning closed itemset lattices for associations rules.
Bases de Données Avancées
1998
http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98
conf/bda/1998
analysis, association, closed, concept, fca, formal, itemset, mining, rules