@techreport{stumme99conceptualknowledge,
  author = {Stumme, G.},
  comment = {alpha},
  institution = {TU Darmstadt},
  interhash = {c33970150f97bad7972281e38b42738f},
  intrahash = {6d562dc043ba698acee8a83ce35bde6e},
  privnote = {alpha},
  title = {Conceptual Knowledge Discovery with Frequent Concept Lattices},
  type = {{FB}4-{P}reprint 2043},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/1999/P2043.pdf},
  year = 1999
}

@inproceedings{stumme02efficient,
  address = {Heidelberg},
  author = {Stumme, G.},
  booktitle = {Database and Expert Systems Applications. Proc. DEXA 2002},
  editor = {Hameurlain, A. and Cicchetti, R. and Traunmüller, R.},
  interhash = {56611a15d60e2711a0aafc257715c03d},
  intrahash = {0adce6a0db24566bb55d6e2d6667c8e7},
  pages = {534-546},
  privnote = {Invited Talk, summary of \cite{stumme02computing} and \cite{pasquierinpressgenerating}},
  publisher = {Springer},
  series = {LNCS},
  title = {Efficient Data Mining Based on Formal Concept Analysis},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2002/DEXA02.pdf},
  volume = 2453,
  year = 2002
}

@inproceedings{stumme01intelligent,
  address = {Heidelberg},
  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.},
  booktitle = {KI 2001: Advances in Artificial Intelligence. KI 2001},
  editor = {Baader, F. and Brewker, G. and Eiter, T.},
  interhash = {15d7d015c8820a41323ab4e7639ff151},
  intrahash = {d93292a7637bd2061b67f4934e7dde46},
  pages = {335-350},
  privnote = {alpha},
  publisher = {Springer},
  series = {LNAI},
  title = {Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/KI01.pdf},
  volume = 2174,
  year = 2001
}

@inproceedings{bastide00miningminimal,
  address = {Heidelberg},
  author = {Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.},
  booktitle = {Computational Logic --- CL 2000 Proc. CL'00},
  editor = {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.},
  interhash = {dc10d0ad3c40463f049ac775cb250f3d},
  intrahash = {25fa3431e7bdd7057f9b80a7385cd718},
  page = {972-986},
  privnote = {{P}art of \cite{pasquierinpressgenerating}},
  publisher = {Springer},
  series = {LNAI},
  title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf},
  volume = 1861,
  year = 2000
}

@article{bastide02unalogorithme,
  author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
  comment = {alpha},
  interhash = {57813a40a2892bdbdae79116ce2f9d5a},
  intrahash = {494ab134ddccac2af4a1d4a7cb52a78d},
  journal = {Technique et Science Informatiques (TSI)},
  number = 1,
  pages = {65-95},
  privnote = {alpha},
  title = {Pascal: un alogorithme d'extraction des motifs fréquents},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/TSI01.pdf},
  volume = 21,
  year = 2002
}

@inproceedings{bastide00levelwise,
  address = {France},
  author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
  booktitle = {Actes des 16ièmes Journées Bases de Données Avancées},
  comment = {alpha},
  interhash = {a3181cc73b190099592107cf465c4e43},
  intrahash = {a11de6a74851c7076452159d1b12489b},
  month = {Oct 24-27},
  pages = {307-322},
  privnote = {alpha},
  publisher = {Blois},
  title = {Levelwise Search of Frequent Patterns},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/BDA00.pdf},
  year = 2000
}

@inproceedings{stumme00fast,
  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.},
  booktitle = {Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases},
  comment = {alpha},
  editor = {Bouzeghoub, M. and Klusch, M. and Nutt, W. and Sattler, U.},
  interhash = {12f70b6e4c9bd5fbbec7aea5aba76a89},
  intrahash = {dcfad94fb256027fbe41150d5ca35d5f},
  note = {\url{http://ceur-ws.org/Vol-29.} {P}art of \cite{stumme02computing}},
  privnote = {alpha},
  title = {Fast Computation of Concept Lattices Using Data Mining Techniques},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/KRDB00.pdf},
  year = 2000
}

@article{bastide00miningfrequent,
  author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
  interhash = {86c9586115ef1c7ec8539257849d9842},
  intrahash = {1e79f8ba76044d2c78cea441eeba84aa},
  journal = {SIGKDD Explorations, Special Issue on Scalable Algorithms},
  number = 2,
  pages = {71-80},
  title = {Mining Frequent Patterns with Counting Inference.},
  volume = 2,
  year = 2000
}