@phdthesis{rioult05extraction,
  address = {Universit\´{e} de Caen Basse-Normandie},
  author = {Rioult, Francois},
  interhash = {c9c4cef416c018a834212b70b7e0c9f7},
  intrahash = {03bb85291b2330c261974067499e115c},
  title = {Extraction de connaissances dans les bases de donnees comportant des valeurs manquantes ou un grand nombre d'attributs},
  year = 2005
}

@inproceedings{pasquier98pruning,
  author = {Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi},
  booktitle = {Bases de Données Avancées},
  crossref = {conf/bda/1998},
  date = {2006-09-14},
  editor = {Bouzeghoub, Mokrane},
  interhash = {74868c54bf26d7cec48c0f8f219d5e67},
  intrahash = {2fcd39ace346867762f3e6abe5a35ccb},
  title = {Pruning closed itemset lattices for associations rules.},
  url = {http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98},
  year = 1998
}

@inproceedings{pasquier98pruning,
  author = {Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi},
  booktitle = {Bases de Donn�es Avanc�es},
  crossref = {conf/bda/1998},
  date = {2006-09-14},
  editor = {Bouzeghoub, Mokrane},
  interhash = {74868c54bf26d7cec48c0f8f219d5e67},
  intrahash = {20dd28b712c5380c17f536734fb1a804},
  title = {Pruning closed itemset lattices for associations rules.},
  url = {http://dblp.uni-trier.de/db/conf/bda/bda98.html#PasquierBTL98},
  year = 1998
}

@phdthesis{rioult05extraction,
  address = {Universit� de Caen Basse-Normandie},
  author = {Rioult, Francois},
  interhash = {e627ed3530b0accde3ee8163afc12d44},
  intrahash = {7125f603ca6a7bd719fbab8ace61bb82},
  title = {Extraction de connaissances dans les bases de donn�es comportant
    des valeurs manquantes ou un grand nombre d'attributs},
  year = 2005
}

@inproceedings{schmitz2006mining,
  author = {Schmitz, Christoph and Hotho, Andreas and J{\"a}schke, Robert and Stumme, Gerd},
  booktitle = {Proceedings of the IFCS 2006 Conference},
  interhash = {b4a63aa5632ff093c2d345005fa16a17},
  intrahash = {2b03548ecac6af9bb56dae6bdf3d9b67},
  month = {July},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Mining Association Rules in Folksonomies},
  year = 2006
}

@inproceedings{hotho2006entstehen,
  abstract = {Immer mehr Soziale-Lesezeichen-Systeme entstehen im heutigen Web. In solchen Systemen erstellen die Nutzer leichtgewichtige begriffliche Strukturen, so genannte Folksonomies. Ihren Erfolg verdanken sie der Tatsache, dass man keine speziellen Fähigkeiten benötigt, um an der Gestaltung mitzuwirken. In diesem Artikel beschreiben wir unser System BibSonomy. Es erlaubt das Speichern, Verwalten und Austauschen sowohl von Lesezeichen (Bookmarks) als auch von Literaturreferenzen in Form von BibTeX-Einträgen. Die Entwicklung des verwendeten Vokabulars und der damit einhergehenden Entstehung einer gemeinsamen Semantik wird detailliert diskutiert.},
  address = {Baden-Baden},
  author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd},
  booktitle = {Social Software in der Wertschöpfung},
  interhash = {1b39e4a77cac919f9030601711aad543},
  intrahash = {a333df6fdc7ff9322e3ce03988a7965e},
  publisher = {Nomos},
  title = {Das Entstehen von Semantik in BibSonomy},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006entstehen.pdf},
  year = 2006
}

@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},
  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
}

@techreport{stumme99conceptualknowledge,
  author = {Stumme, G.},
  comment = {alpha},
  institution = {TU Darmstadt},
  interhash = {c33970150f97bad7972281e38b42738f},
  intrahash = {6d562dc043ba698acee8a83ce35bde6e},
  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{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},
  publisher = {Blois},
  title = {Levelwise Search of Frequent Patterns},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/BDA00.pdf},
  year = 2000
}

@article{pasquier2005generating,
  author = {Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi},
  comment = {alpha},
  interhash = {cb0ee99fae39f2a5e0af5be9d97978f5},
  intrahash = {40f59a7fa7ce5015f9ee81709db89de0},
  journal = {Journal Intelligent Information Systems (JIIS)},
  number = 1,
  pages = {29-60},
  publisher = {Kluwer Academic Publishers},
  title = {Generating a Condensed Representation for Association Rules},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf},
  volume = 24,
  year = 2005
}

@inproceedings{schmitz2006mining,
  address = {Berlin, Heidelberg},
  author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
  booktitle = {Data Science and Classification: Proc. of the 10th IFCS Conf.},
  editor = {Batagelj, V. and Bock, H.-H. and Ferligoj, A. and {\v Z}iberna, A.},
  interhash = {20650d852ca3b82523fcd8b63e7c12d7},
  intrahash = {1e79a0f1c79561073d14434adce1e890},
  pages = {261--270},
  publisher = {Springer},
  series = {Studies in Classification, Data Analysis, and Knowledge Organization},
  title = {Mining Association Rules in Folksonomies},
  year = 2006
}

@inbook{lakhal2005efficient,
  abstract = {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, \titanic, 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.},
  address = {Heidelberg},
  author = {Lakhal, Lotfi and Stumme, Gerd},
  booktitle = {Formal Concept Analysis: Foundations and Applications},
  editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
  ee = {http://dx.doi.org/10.1007/11528784_10},
  interhash = {f5777a0f9dccfcf4f9968119d77297fc},
  intrahash = {2b350f817428e4c6c7259cd279815091},
  pages = {180-195},
  publisher = {Springer},
  series = {LNAI},
  title = {Efficient Mining of Association Rules Based on Formal Concept Analysis},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf},
  volume = 3626,
  year = 2005
}

@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},
  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{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},
  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{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{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},
  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
}