@incollection{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 },
  author = {Lakhal, Lotfi and Stumme, Gerd},
  booktitle = {Formal Concept Analysis},
  doi = {10.1007/11528784_10},
  editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
  interhash = {f5777a0f9dccfcf4f9968119d77297fc},
  intrahash = {fbb41ddbb0a52d1ecca438655e652f09},
  isbn = {978-3-540-27891-7},
  language = {English},
  pages = {180-195},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {Efficient Mining of Association Rules Based on Formal Concept Analysis},
  url = {http://dx.doi.org/10.1007/11528784_10},
  volume = 3626,
  year = 2005
}

@article{suneetha2005identifying,
  author = {Suneetha, K. R. and Krishnamoorthy, K. R.},
  interhash = {3df19221981310e32b8325c9226d03cd},
  intrahash = {409a7c28e5ab6edebfaccb4d2f4c1503},
  journal = {International Journal of Computer Science and Network Security},
  number = 4,
  pages = {327-332},
  title = {Identifying User Behavior by Analyzing Web Server 
Access Log File},
  volume = 9,
  year = 2005
}

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

@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{hotho2006das,
  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},
  file = {hotho2006das.pdf:hotho2006das.pdf:PDF},
  groups = {public},
  interhash = {1b39e4a77cac919f9030601711aad543},
  intrahash = {a333df6fdc7ff9322e3ce03988a7965e},
  pdf = {E:\home\help_of_all_helps.pdf},
  publisher = {Nomos},
  timestamp = {2009-09-29 12:35:44},
  title = {Das Entstehen von Semantik in BibSonomy},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006entstehen.pdf},
  username = {dbenz},
  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
}

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

@inproceedings{schmitz2006mining,
  address = {Berlin/Heidelberg},
  author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
  booktitle = {Data Science and Classification (Proc. IFCS 2006 Conference)},
  doi = {10.1007/3-540-34416-0_28},
  editor = {Batagelj, V. and Bock, H.-H. and Ferligoj, A. and Žiberna, A.},
  interhash = {20650d852ca3b82523fcd8b63e7c12d7},
  intrahash = {c8dbb6371be8d67e3aa1928bd3dd0fed},
  isbn = {978-3-540-34415-5},
  month = {July},
  note = {Ljubljana},
  pages = {261-270},
  publisher = {Springer},
  series = {Studies in Classification, Data Analysis, and Knowledge Organization},
  title = {Mining Association Rules in Folksonomies},
  url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2006/schmitz2006asso_ifcs.pdf},
  vgwort = {18},
  year = 2006
}

@inproceedings{agrawal93,
  address = {New York, NY, USA},
  author = {Agrawal, Rakesh and Imielinski, Tomasz and Swami, Arun},
  booktitle = {SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of data},
  interhash = {53341ce3e6ce51c3bcf8b0219ec239b5},
  intrahash = {ca35e602124130b480592b3a55267006},
  pages = {207--216},
  publisher = {ACM Press},
  title = {Mining association rules between sets of items in large databases},
  year = 1993
}

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

@inproceedings{xin2008www,
  abstract = {The success and popularity of social network systems, such as del.icio.us, Facebook, MySpace, and YouTube, have generated many interesting and challenging problems to the research community. Among others, discovering social interests shared by groups of users is very important because it helps to connect people with common interests and encourages people to contribute and share more contents. The main challenge to solving this problem comes from the diffi- culty of detecting and representing the interest of the users. The existing approaches are all based on the online connections of users and so unable to identify the common interest of users who have no online connections. In this paper, we propose a novel social interest discovery approach based on user-generated tags. Our approach is motivated by the key observation that in a social network, human users tend to use descriptive tags to annotate the contents that they are interested in. Our analysis on a large amount of real-world traces reveals that in general, user-generated tags are consistent with the web content they are attached to, while more concise and closer to the understanding and judgments of human users about the content. Thus, patterns of frequent co-occurrences of user tags can be used to characterize and capture topics of user interests. We have developed an Internet Social Interest Discovery system, ISID, to discover the common user interests and cluster users and their saved URLs by different interest topics. Our evaluation shows that ISID can effectively cluster similar documents by interest topics and discover user communities with common interests no matter if they have any online connections.},
  author = {Li, Xin and Guo, Lei and Zhao, Yihong E.},
  booktitle = {Proceedings of the 17th International World Wide Web Conference},
  interhash = {d7e6a5b8d215682b2a75add69c01de29},
  intrahash = {42b4c94cff05ccef031235d661a7a77a},
  pages = {675-684},
  publisher = {ACM},
  title = {Tag-based Social Interest Discovery},
  url = {http://www2008.org/papers/pdf/p675-liA.pdf},
  year = 2008
}

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