TY - GEN AU - Lakhal, Lotfi AU - Stumme, Gerd A2 - Ganter, Bernhard A2 - Stumme, Gerd A2 - Wille, Rudolf T1 - Efficient Mining of Association Rules Based on Formal Concept Analysis JO - PB - Springer C1 - Heidelberg PY - 2005/ VL - 3626 IS - SP - 180 EP - 195 UR - http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf DO - KW - 2005 KW - analysis KW - association KW - book KW - closed KW - concept KW - condensed KW - data KW - discovery KW - fca KW - formal KW - itegpub KW - itemsets KW - kdd KW - knowledge KW - l3s KW - mining KW - myown KW - representations KW - rules L1 - N1 - Publications of Gerd Stumme N1 - AB - 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. ER - TY - JOUR AU - Pasquier, Nicolas AU - Taouil, Rafik AU - Bastide, Yves AU - Stumme, Gerd AU - Lakhal, Lotfi T1 - Generating a Condensed Representation for Association Rules JO - Journal Intelligent Information Systems (JIIS) PY - 2005/ VL - 24 IS - 1 SP - 29 EP - 60 UR - http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf DO - KW - 2005 KW - OntologyHandbook KW - analysis KW - association KW - closed KW - concept KW - condensed KW - data KW - discovery KW - fca KW - formal KW - itegpub KW - itemset KW - kdd KW - knowledge KW - l3s KW - mining KW - myown KW - representations KW - rule KW - rules KW - sets L1 - SN - N1 - Publications of Gerd Stumme N1 - AB - ER - TY - JOUR AU - Bastide, Y. AU - Taouil, R. AU - Pasquier, N. AU - Stumme, G. AU - Lakhal, L. T1 - Pascal: un alogorithme d'extraction des motifs fréquents JO - Technique et Science Informatiques (TSI) PY - 2002/ VL - 21 IS - 1 SP - 65 EP - 95 UR - http://www.kde.cs.uni-kassel.de/stumme/papers/2001/TSI01.pdf DO - KW - 2002 KW - analysis KW - association KW - closed KW - concept KW - condensed KW - fca KW - formal KW - iceberg KW - itemsets KW - lattices KW - myown KW - pascal KW - representations KW - rules KW - titanic L1 - SN - N1 - Publications of Gerd Stumme N1 - AB - ER - TY - JOUR AU - Stumme, G. AU - Taouil, R. AU - Bastide, Y. AU - Pasqier, N. AU - Lakhal, L. T1 - Computing Iceberg Concept Lattices with Titanic JO - J. Data and KnowledgeEngineering (DKE) PY - 2002/ VL - 42 IS - 2 SP - 189 EP - 222 UR - http://www.kde.cs.uni-kassel.de/stumme/papers/2002/stumme2002computing.pdf DO - KW - 2002 KW - analysis KW - closed KW - concept KW - fca KW - formal KW - iceberg KW - itemsets KW - lattices KW - myown KW - titanic L1 - SN - N1 - Publications of Gerd Stumme N1 - AB - ER - TY - CONF AU - Stumme, G. A2 - Hameurlain, A. A2 - Cicchetti, R. A2 - Traunmüller, R. T1 - Efficient Data Mining Based on Formal Concept Analysis T2 - Database and Expert Systems Applications. Proc. DEXA 2002 PB - Springer C1 - Heidelberg PY - 2002/ CY - VL - 2453 IS - SP - 534 EP - 546 UR - http://www.kde.cs.uni-kassel.de/stumme/papers/2002/DEXA02.pdf DO - KW - 2002 KW - association KW - closed KW - condensed KW - data KW - discovery KW - fca KW - itemsets KW - kdd KW - knowledge KW - mining KW - myown KW - representations KW - rules L1 - SN - N1 - Publications of Gerd Stumme N1 - AB - ER - TY - CONF AU - Stumme, G. AU - Taouil, R. AU - Bastide, Y. AU - Lakhal, L. A2 - Klinkenberg, R. A2 - Rüping, S. A2 - Fick, A. A2 - Henze, N. A2 - Herzog, C. A2 - Molitor, R. A2 - Schröder, O. T1 - Conceptual Clustering with Iceberg Concept Lattices T2 - Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01) PB - C1 - Universität Dortmund 763 PY - 2001/october CY - VL - IS - SP - EP - UR - http://www.kde.cs.uni-kassel.de/stumme/papers/2001/FGML01.pdf DO - KW - 2001 KW - analysis KW - closed KW - clustering KW - concept KW - conceptual KW - discovery KW - fca KW - formal KW - iceberg KW - itemsets KW - kdd KW - knowledge KW - lattices KW - myown L1 - SN - N1 - Publications of Gerd Stumme N1 - AB - ER - TY - CONF AU - Stumme, G. AU - Taouil, R. AU - Bastide, Y. AU - Pasquier, N. AU - Lakhal, L. A2 - Baader, F. A2 - Brewker, G. A2 - Eiter, T. T1 - Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis T2 - KI 2001: Advances in Artificial Intelligence. KI 2001 PB - Springer C1 - Heidelberg PY - 2001/ CY - VL - 2174 IS - SP - 335 EP - 350 UR - http://www.kde.cs.uni-kassel.de/stumme/papers/2001/KI01.pdf DO - KW - 2001 KW - FCA KW - OntologyHandbook KW - analysis KW - association KW - bases KW - closed KW - concept KW - condensed KW - discovery KW - fca KW - formal KW - itemsets KW - kdd KW - knowledge KW - mining KW - myown KW - representations KW - rule KW - rules L1 - SN - N1 - Publications of Gerd Stumme N1 - AB - ER - TY - CONF AU - Bastide, Y. AU - Taouil, R. AU - Pasquier, N. AU - Stumme, G. AU - Lakhal, L. A2 - T1 - Levelwise Search of Frequent Patterns T2 - Actes des 16ièmes Journées Bases de Données Avancées PB - Blois C1 - France PY - 2000/oct 24-27 CY - VL - IS - SP - 307 EP - 322 UR - http://www.kde.cs.uni-kassel.de/stumme/papers/2000/BDA00.pdf DO - KW - 2000 KW - algorithm KW - algorithms KW - analysis KW - association KW - closed KW - concept KW - condensed KW - data KW - discovery KW - fca KW - formal KW - frequent KW - itemsets KW - kdd KW - knowledge KW - mining KW - myown KW - representations KW - rules L1 - SN - N1 - Publications of Gerd Stumme N1 - AB - ER - TY - JOUR AU - Bastide, Y. AU - Taouil, R. AU - Pasquier, N. AU - Stumme, G. AU - Lakhal, L. T1 - Mining Frequent Patterns with Counting Inference. JO - SIGKDD Explorations, Special Issue on Scalable Algorithms PY - 2000/ VL - 2 IS - 2 SP - 71 EP - 80 UR - DO - KW - 2000 KW - FCA KW - OntologyHandbook KW - analys KW - association KW - closed KW - concept KW - condensed KW - data KW - discovery KW - fca KW - formal KW - frequent KW - itemsets KW - kdd KW - knowledge KW - mining KW - myown KW - representation KW - representations KW - rule KW - rules L1 - SN - N1 - Publications of Gerd Stumme N1 - AB - ER - TY - CONF AU - Bastide, Y. AU - Pasquier, N. AU - Taouil, R. AU - Stumme, G. AU - Lakhal, L. A2 - Lloyd, J. A2 - Dahl, V. A2 - Furbach, U. A2 - Kerber, M. A2 - Laus, K.-K. A2 - Palamidessi, C. A2 - Pereira, L.M. A2 - Sagiv, Y. A2 - Stuckey, P.J. T1 - Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets T2 - Computational Logic --- CL 2000 Proc. CL'00 PB - Springer C1 - Heidelberg PY - 2000/ CY - VL - 1861 IS - SP - EP - UR - http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf DO - KW - 2000 KW - analys KW - association KW - closed KW - concept KW - condensed KW - data KW - discovery KW - fca KW - formal KW - frequent KW - itemsets KW - kdd KW - knowledge KW - mining KW - myown KW - representation KW - representations KW - rule KW - rules L1 - SN - N1 - Publications of Gerd Stumme N1 - AB - ER - TY - CONF AU - Boulicaut, Jean-Francois AU - Bykowski, Artur AU - Rigotti, Christophe A2 - T1 - Approximation of Frequency Queris by Means of Free-Sets T2 - Principles of Data Mining and Knowledge Discovery PB - C1 - PY - 2000/ CY - VL - IS - SP - 75 EP - 85 UR - citeseer.ist.psu.edu/boulicaut00approximation.html DO - KW - Analysis KW - Concept KW - Formal KW - closed KW - dm KW - fca KW - free KW - itemset KW - itemsets KW - kdd KW - mining KW - sets L1 - SN - N1 - Approximation of Frequency Queries By Means of Free-Sets - Boulicaut, Bykowski, Rigotti (ResearchIndex) N1 - AB - ER - TY - CONF AU - Stumme, G. AU - Taouil, R. AU - Bastide, Y. AU - Pasquier, N. AU - Lakhal, L. A2 - Bouzeghoub, M. A2 - Klusch, M. A2 - Nutt, W. A2 - Sattler, U. T1 - Fast Computation of Concept Lattices Using Data Mining Techniques T2 - Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases PB - C1 - PY - 2000/ CY - VL - IS - SP - EP - UR - http://www.kde.cs.uni-kassel.de/stumme/papers/2000/KRDB00.pdf DO - KW - 2000 KW - algorithm KW - algorithms KW - analysis KW - closed KW - computation KW - concept KW - condensed KW - fca KW - formal KW - iceberg KW - itemsets KW - lattices KW - myown KW - representations L1 - SN - N1 - Publications of Gerd Stumme N1 - AB - ER - TY - RPRT AU - Stumme, G. A2 - T1 - Conceptual Knowledge Discovery with Frequent Concept Lattices PB - TU Darmstadt AD - PY - 1999/ VL - IS - SP - EP - UR - http://www.kde.cs.uni-kassel.de/stumme/papers/1999/P2043.pdf DO - KW - 1999 KW - analysis KW - association KW - closed KW - concept KW - condensed KW - data KW - discovery KW - fca KW - formal KW - frequent KW - iceberg KW - itemsets KW - kdd KW - knowledge KW - lattices KW - mining KW - myown KW - representations KW - rule KW - rules L1 - N1 - Publications of Gerd Stumme N1 - FB4-Preprint 2043 N1 - AB - ER - TY - CONF AU - Pasquier, Nicolas AU - Bastide, Yves AU - Taouil, Rafik AU - Lakhal, Lotfi A2 - Bouzeghoub, Mokrane T1 - Pruning closed itemset lattices for associations rules. T2 - Bases de Donn�es Avanc�es PB - C1 - PY - 1998/ CY - VL - IS - SP - EP - UR - http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98 DO - KW - FCA KW - OntologyHandbook KW - analysis KW - association KW - closed KW - concept KW - fca KW - formal KW - itemset KW - mining KW - rules L1 - SN - N1 - N1 - AB - ER - TY - CONF AU - Pasquier, Nicolas AU - Bastide, Yves AU - Taouil, Rafik AU - Lakhal, Lotfi A2 - Bouzeghoub, Mokrane T1 - Pruning closed itemset lattices for associations rules. T2 - Bases de Données Avancées PB - C1 - PY - 1998/ CY - VL - IS - SP - EP - UR - http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98 DO - KW - analysis KW - association KW - closed KW - concept KW - fca KW - formal KW - itemset KW - mining KW - rules L1 - SN - N1 - N1 - AB - ER -