BibliographyType,ISBN,Identifier,Author,Title,Journal,Volume,Number,Month,Pages,Year,Address,Note,URL,Booktitle,Chapter,Edition,Series,Editor,Publisher,ReportType,Howpublished,Institution,Organizations,School,Annote,Custom1,Custom2,Custom3,Custom4,Custom5
5,"","lakhal2005efficient","Lakhal, Lotfi & Stumme, Gerd","Efficient Mining of Association Rules Based on Formal Concept Analysis","",3626,,"","180-195",2005,"Heidelberg","","http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf","Formal Concept Analysis: Foundations and Applications","","","LNAI","Ganter, Bernhard; Stumme, Gerd & Wille, Rudolf","Springer","","","","","","","Association rules are a popular knowledge discovery technique forwarehouse basket analysis. They indicate which items of thewarehouse are frequently bought together. The problem of associationrule mining has first been stated in 1993. Five years later, severalresearch groups discovered that this problem has a strong connectionto Formal Concept Analysis (FCA). In this survey, we will firstintroduce some basic ideas of this connection along a specificalgorithm, \titanic, and show how FCA helps in reducing the numberof resulting rules without loss of information, before giving ageneral overview over the history and state of the art of applyingFCA for association rule mining.","Publications of Gerd Stumme","2005, analysis, association, book, closed, concept, condensed, data, discovery, fca, formal, itegpub, itemsets, kdd, knowledge, l3s, mining, myown, representations, rules","",""
7,"","pasquier2005generating","Pasquier, Nicolas; Taouil, Rafik; Bastide, Yves; Stumme, Gerd & Lakhal, Lotfi","Generating a Condensed Representation for Association Rules","Journal Intelligent Information Systems (JIIS)",24,1,"","29-60",2005,"","","http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf","","","","","","Kluwer Academic Publishers","","","","","","","","Publications of Gerd Stumme","2005, OntologyHandbook, analysis, association, closed, concept, condensed, data, discovery, fca, formal, itegpub, itemset, kdd, knowledge, l3s, mining, myown, representations, rule, rules, sets","",""
6,"","stumme02efficient","Stumme, G.","Efficient Data Mining Based on Formal Concept Analysis","",2453,,"","534-546",2002,"Heidelberg","","http://www.kde.cs.uni-kassel.de/stumme/papers/2002/DEXA02.pdf","Database and Expert Systems Applications. Proc. DEXA 2002","","","LNCS","Hameurlain, A.; Cicchetti, R. & Traunmüller, R.","Springer","","","","","","","","Publications of Gerd Stumme","2002, association, closed, condensed, data, discovery, fca, itemsets, kdd, knowledge, mining, myown, representations, rules","",""
6,"","stumme01intelligent","Stumme, G.; Taouil, R.; Bastide, Y.; Pasquier, N. & Lakhal, L.","Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis","",2174,,"","335-350",2001,"Heidelberg","","http://www.kde.cs.uni-kassel.de/stumme/papers/2001/KI01.pdf","KI 2001: Advances in Artificial Intelligence. KI 2001","","","LNAI","Baader, F.; Brewker, G. & Eiter, T.","Springer","","","","","","","","Publications of Gerd Stumme","2001, FCA, OntologyHandbook, analysis, association, bases, closed, concept, condensed, discovery, fca, formal, itemsets, kdd, knowledge, mining, myown, representations, rule, rules","",""
6,"","bastide00levelwise","Bastide, Y.; Taouil, R.; Pasquier, N.; Stumme, G. & Lakhal, L.","Levelwise Search of Frequent Patterns","",,,"Oct 24-27","307-322",2000,"France","","http://www.kde.cs.uni-kassel.de/stumme/papers/2000/BDA00.pdf","Actes des 16ièmes Journées Bases de Données Avancées","","","","","Blois","","","","","","","","Publications of Gerd Stumme","2000, algorithm, algorithms, analysis, association, closed, concept, condensed, data, discovery, fca, formal, frequent, itemsets, kdd, knowledge, mining, myown, representations, rules","",""
7,"","bastide00miningfrequent","Bastide, Y.; Taouil, R.; Pasquier, N.; Stumme, G. & Lakhal, L.","Mining Frequent Patterns with Counting Inference.","SIGKDD Explorations, Special Issue on Scalable Algorithms",2,2,"","71-80",2000,"","","","","","","","","","","","","","","","","Publications of Gerd Stumme","2000, FCA, OntologyHandbook, analys, association, closed, concept, condensed, data, discovery, fca, formal, frequent, itemsets, kdd, knowledge, mining, myown, representation, representations, rule, rules","",""
6,"","bastide00miningminimal","Bastide, Y.; Pasquier, N.; Taouil, R.; Stumme, G. & Lakhal, L.","Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets","",1861,,"","",2000,"Heidelberg","","http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf","Computational Logic --- CL 2000 Proc. CL'00","","","LNAI","Lloyd, J.; Dahl, V.; Furbach, U.; Kerber, M.; Laus, K.-K.; Palamidessi, C.; Pereira, L.M.; Sagiv, Y. & Stuckey, P.J.","Springer","","","","","","","","Publications of Gerd Stumme","2000, analys, association, closed, concept, condensed, data, discovery, fca, formal, frequent, itemsets, kdd, knowledge, mining, myown, representation, representations, rule, rules","",""
6,"","boulicaut00approximation","Boulicaut, Jean-Francois; Bykowski, Artur & Rigotti, Christophe","Approximation of Frequency Queris by Means of Free-Sets","",,,"","75-85",2000,"","","citeseer.ist.psu.edu/boulicaut00approximation.html","Principles of Data Mining and Knowledge Discovery","","","","","","","","","","","","","Approximation of Frequency Queries By Means of Free-Sets - Boulicaut, Bykowski, Rigotti (ResearchIndex)","Analysis, Concept, Formal, closed, dm, fca, free, itemset, itemsets, kdd, mining, sets","",""
13,"","stumme99conceptualknowledge","Stumme, G.","Conceptual Knowledge Discovery with Frequent Concept Lattices","",,,"","",1999,"","","http://www.kde.cs.uni-kassel.de/stumme/papers/1999/P2043.pdf","","","","","","","","","TU Darmstadt","","","","","Publications of Gerd Stumme","1999, analysis, association, closed, concept, condensed, data, discovery, fca, formal, frequent, iceberg, itemsets, kdd, knowledge, lattices, mining, myown, representations, rule, rules","",""
6,"","pasquier98pruning","Pasquier, Nicolas; Bastide, Yves; Taouil, Rafik & Lakhal, Lotfi","Pruning closed itemset lattices for associations rules.","",,,"","",1998,"","","http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98","Bases de Donn�es Avanc�es","","","","Bouzeghoub, Mokrane","","","","","","","","","","FCA, OntologyHandbook, analysis, association, closed, concept, fca, formal, itemset, mining, rules","",""
6,"","pasquier98pruning","Pasquier, Nicolas; Bastide, Yves; Taouil, Rafik & Lakhal, Lotfi","Pruning closed itemset lattices for associations rules.","",,,"","",1998,"","","http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98","Bases de Données Avancées","","","","Bouzeghoub, Mokrane","","","","","","","","","","analysis, association, closed, concept, fca, formal, itemset, mining, rules","",""