@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{Stum00fast,
  address = {Berlin},
  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},
  interhash = {12f70b6e4c9bd5fbbec7aea5aba76a89},
  intrahash = {a17891b3a55b119d0b8ca5d398a9fe1b},
  month = {21--22.August},
  note = {{http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/}},
  publisher = {CEUR-Workshop Proceeding.},
  title = {Fast computation of concept lattices using data mining techniques.},
  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
}

@inproceedings{Pasquier00a,
  author = {Pasquier, N.},
  booktitle = {Actes du 18�me congr�s sur l'Informatique des Organisations et Syst�mes
    d'Information et de D�cision (INFORSID'2000)},
  interhash = {3cd1350647284b176f14b5f2fd1142d6},
  intrahash = {6e328d42ce8b9d563f5812baa251ce08},
  month = May,
  title = {Extraction de bases pour les r�gles d'association � partir des itemsets
    ferm�s fr�quents},
  year = 2000
}

@inproceedings{Taouil00b,
  author = {Taouil, R. and Pasquier, N. and Bastide, Y. and Lakhal, L.},
  booktitle = {Proceedings of the 16th International Conference on Data Engineering
    (ICDE'2000)},
  interhash = {6f39f991e723c94ed6ee0ac7f5e73f08},
  intrahash = {2f8627e91890511bd640a269cd248aae},
  month = {Febuary},
  pages = 307,
  publisher = {IEEE Computer Society Press},
  title = {Mining bases for association rules using \textsc{G}alois closed sets},
  year = 2000
}

@article{Pasquier99c,
  author = {Pasquier, N. and Bastide, Y. and Taouil, R. and Lakhal, L.},
  editor = {Jarke, M. and Shasha, D.},
  interhash = {14f55460561c18e8d47a1ffaad6bb738},
  intrahash = {5f42a9dddba984d165ce53f3f5b9a8d2},
  journal = {Information Systems},
  number = 1,
  pages = {25--46},
  publisher = {Elsevier Science},
  title = {Efficient mining of association rules using closed itemset lattices},
  volume = 24,
  year = 1999
}

@inproceedings{Pasquier99a,
  author = {Pasquier, N. and Bastide, Y. and Taouil, R. and Lakhal, L.},
  booktitle = {Actes des 15�mes journ�es Bases de Donn�es Avanc�es (BDA'99)},
  interhash = {8263057eb9fb4c543c7b64a782e6ae74},
  intrahash = {3e865c8a8f4f20ef4ccdc142a93143c0},
  month = {Octobre},
  pages = {361--381},
  title = {Closed set based discovery of small covers for association rules},
  year = 1999
}

@inproceedings{Pasquier98,
  author = {Pasquier, N. and Bastide, Y. and Taouil, R. and Lakhal, L.},
  booktitle = {Actes des 14�mes journ�es Bases de Donn�es Avanc�es (BDA'98)},
  interhash = {5f64f8ccdb62c71ef5d12864ca6e20d7},
  intrahash = {6444168dafdeae859e5a42f24182940e},
  month = {Octobre},
  pages = {177--196},
  title = {Pruning closed itemset lattices for association rules},
  year = 1998
}

@unpublished{Taouil99,
  author = {Taouil, R. and Pasquier, N. and Bastide, Y. and Lakhal, L.},
  interhash = {a29f3256c9d97f1f0f4dc335960ec245},
  intrahash = {4a8ecd87087f09223035ab35f562736a},
  note = {Rapport de recherche.},
  title = {Computing closed sets lattices : Algorithms, applications and performances},
  year = 1999
}

@inproceedings{Pasquier99b,
  author = {Pasquier, N. and Bastide, Y. and Taouil, R. and Lakhal, L.},
  booktitle = {Proceedings of the 7th biennial International Conference on Database
    Theory (ICDT'99)},
  interhash = {f42c8a27033e6e9a9dff07fce270844b},
  intrahash = {bc93480a1aec5a51ed2f326f89c7037b},
  month = {January},
  pages = {398--416},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science, Vol. 1540},
  title = {Discovering frequent closed itemsets for association rules},
  year = 1999
}