@Inbook{lakhal2005efficient, author = {Lakhal, Lotfi and Stumme, Gerd}, title = {Efficient Mining of Association Rules Based on Formal Concept Analysis}, year = {2005}, number = {}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf}, const = {\ text} } @Article{pasquier2005generating, author = {Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi}, title = {Generating a Condensed Representation for Association Rules}, journal = {Journal Intelligent Information Systems (JIIS)}, year = {2005}, number = {1}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf}, const = {\ text} } @Article{bastide02unalogorithme, author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.}, title = {Pascal: un alogorithme d'extraction des motifs fréquents}, journal = {Technique et Science Informatiques (TSI)}, year = {2002}, number = {1}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/TSI01.pdf}, const = {\ text} } @Inproceedings{stumme02efficient, author = {Stumme, G.}, title = {Efficient Data Mining Based on Formal Concept Analysis}, year = {2002}, number = {}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2002/DEXA02.pdf}, const = {\ text} } @Inproceedings{stumme01intelligent, author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.}, title = {Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis}, year = {2001}, number = {}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/KI01.pdf}, const = {\ text} } @Inproceedings{bastide00levelwise, author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.}, title = {Levelwise Search of Frequent Patterns}, year = {2000}, number = {}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/BDA00.pdf}, const = {\ text} } @Article{bastide00miningfrequent, author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.}, title = {Mining Frequent Patterns with Counting Inference.}, journal = {SIGKDD Explorations, Special Issue on Scalable Algorithms}, year = {2000}, number = {2}, url = {}, const = {\ text} } @Inproceedings{bastide00miningminimal, author = {Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.}, title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets}, year = {2000}, number = {}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf}, const = {\ text} } @Techreport{stumme99conceptualknowledge, author = {Stumme, G.}, title = {Conceptual Knowledge Discovery with Frequent Concept Lattices}, year = {1999}, number = {}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/1999/P2043.pdf}, const = {\ text} } @Inproceedings{pasquier98pruning, author = {Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi}, title = {Pruning closed itemset lattices for associations rules.}, year = {1998}, number = {}, url = {http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98}, const = {\ text} } @Inproceedings{pasquier98pruning, author = {Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi}, title = {Pruning closed itemset lattices for associations rules.}, year = {1998}, number = {}, url = {http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98}, const = {\ text} }