@inproceedings{stumme02usage,
  address = {Baltimore},
  author = {Stumme, G. and Berendt, B. and Hotho, A.},
  booktitle = {Proc. NSF Workshop on Next Generation Data Mining},
  comment = {alpha},
  interhash = {479de77764be1ec66534be1c647e0857},
  intrahash = {4a68d1443065dcd7980989e97cb0af69},
  month = {November},
  pages = {77-86},
  privnote = {alpha},
  title = {Usage Mining for and on the Semantic Web},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2002/NSF-NGDM02.pdf},
  year = 2002
}

@inproceedings{stumme00towardsanorder,
  address = {Aachen},
  author = {Stumme, G. and Studer, R. and Sure, Y.},
  booktitle = {Verbundtagung Wirtschaftsinformatik 2000},
  comment = {alpha},
  editor = {Bodendorf, F. and Grauer, M.},
  interhash = {9042498686a1b2c000cd4b0007a76bf8},
  intrahash = {83cc12ae3979a3e4108e5442b7da0b4f},
  pages = {136-149},
  privnote = {alpha},
  publisher = {Shaker},
  title = {Towards an Order-Theoretical Foundation for Maintaining and Merging Ontologies},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/REFMOD00.pdf},
  year = 2000
}

@inproceedings{prediger99theory,
  author = {Prediger, S. and Stumme, G.},
  booktitle = {Proc. 6th Intl. Workshop Knowledge Representation Meets Databases (KRDB'99)},
  comment = {alpha},
  editor = {et al, E. Franconi},
  interhash = {f8954580726dabd8427ec6e5f5b03a37},
  intrahash = {012c6e353faa417521e9c88fc5c89f1e},
  note = {Also in: P. Lambrix et al (Eds.): Proc. Intl. Workshop on Description Logics (DL'99). CEUR Workshop Proc. 22, 1999
                  \url{http://ceur-ws.org/Vol-21}},
  privnote = {alpha},
  title = {Theory-Driven Logical Scaling},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/1999/KRDB99.pdf},
  volume = {CEUR Workshop Proc. 21},
  year = 1999
}

@article{benz2010social,
  abstract = {Social resource sharing systems are central elements of the Web 2.0 and use the same kind of lightweight knowledge representation, called folksonomy. Their large user communities and ever-growing networks of user-generated content have made them an attractive object of investigation for researchers from different disciplines like Social Network Analysis, Data Mining, Information Retrieval or Knowledge Discovery. In this paper, we summarize and extend our work on different aspects of this branch of Web 2.0 research, demonstrated and evaluated within our own social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind. We structure this presentation along the different interaction phases of a user with our system, coupling the relevant research questions of each phase with the corresponding implementation issues. This approach reveals in a systematic fashion important aspects and results of the broad bandwidth of folksonomy research like capturing of emergent semantics, spam detection, ranking algorithms, analogies to search engine log data, personalized tag recommendations and information extraction techniques. We conclude that when integrating a real-life application like BibSonomy into research, certain constraints have to be considered; but in general, the tight interplay between our scientific work and the running system has made BibSonomy a valuable platform for demonstrating and evaluating Web 2.0 research.},
  author = {Benz, D and Hotho, A and Jaschke, R and Krause, B and Mitzlaff, F and Schmitz, C and Stumme, G},
  interhash = {102300e311e97ef3f7d78c64c347bf14},
  intrahash = {3df3df75c079a4b2aa5535048fa59d7f},
  journal = {VLDB JOURNAL},
  month = {12},
  number = 6,
  title = {The social bookmark and publication management system bibsonomy A platform for evaluating and demonstrating Web 2.0 research},
  uniqueid = {000286037700006|edswsc},
  volume = 19,
  year = 2010
}

@inproceedings{gonzalez02semantic,
  address = {Helsinki},
  author = {Gonzalez-Olalla, J. and Stumme, G.},
  booktitle = {Semantic Web Mining. Proc. of the Semantic Web Mining Workshop of the 13th Europ. Conf.},
  comment = {alpha},
  editor = {Berendt, B. and Hotho, A. and Stumme, G.},
  interhash = {f66eaa20bfcd4b4b57a8ff851a4a74aa},
  intrahash = {c9fdc0e65bbd2a49ee0b1396b068a76d},
  month = {August 19,},
  pages = 90,
  privnote = {alpha},
  title = {Semantic Methods and Tools for Information Portals - The {S}em{IP}ort Project (Project Description)},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2002/gonzalez2002semantic.pdf},
  year = 2002
}

@inproceedings{hereth01reverse,
  address = {Heidelberg},
  author = {Hereth, J. and Stumme, G.},
  booktitle = {Conceptual Structures: Broadening the Base. },
  comment = {alpha},
  editor = {Delugach, H. and Stumme, G.},
  interhash = {0b01ab0b9c59e8a8d97d0a8d4a0fd041},
  intrahash = {86270d99bc6aafb48a23c650c254d23e},
  pages = {202-215},
  privnote = {alpha},
  publisher = {Springer},
  series = {LNAI},
  title = {Reverse Pivoting in Conceptual Information Systems.},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/ICCS01.pdf},
  volume = 2120,
  year = 2001
}

@inproceedings{HerethStumme01Reverse,
  author = {Hereth, J. and Stumme, G.},
  booktitle = {Conceptual Structures: Broadening the Base},
  editor = {Delugach, H. S. and Stumme, G.},
  interhash = {0b01ab0b9c59e8a8d97d0a8d4a0fd041},
  intrahash = {30e49504f597ba1809649a98b7c3a6b0},
  isbn = {3-540-42344-3},
  pages = {202-215},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Reverse Pivoting in Conceptual Information Systems},
  volume = 2120,
  year = 2001
}

@inproceedings{skorsky1999reuse,
  address = {Würzburg},
  author = {Skorsky, M. and Stumme, G. and Wille, R. and Wille, U.},
  booktitle = {Proc. Workshop on Knowledge Management, Organizational Memory and Reuse, 5th German Conf. on},
  comment = {alpha},
  editor = {Puppe, F. and Fensel, D. and Kühler, J. and Studer, R. and Wetter, Th.},
  interhash = {f74912e57d2732b7bf59c84285a9af5a},
  intrahash = {ff51aec56eefef18f1a089158a9b074c},
  month = {March 3-5,},
  privnote = {alpha},
  title = {Reuse in the Development Process of {TOSCANA} Systems},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/1999/XPS99.pdf},
  year = 1999
}

@article{mitzlaff2012relatedness,
  author = {Mitzlaff, Folke and Stumme, G},
  interhash = {31f7605431c35592afa50e7a377ce999},
  intrahash = {072c87ef744216d0245f28c5f29ce851},
  journal = {Human Journal},
  number = 4,
  pages = {205--217},
  title = {Relatedness of given names},
  volume = 1,
  year = 2012
}

@book{balbymarinho2012recommender,
  abstract = {Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the “noise” that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.},
  author = {Balby Marinho, L. and Hotho, A. and Jäschke, R. and Nanopoulos, A. and Rendle, S. and Schmidt-Thieme, L. and Stumme, G. and Symeonidis, P.},
  doi = {10.1007/978-1-4614-1894-8},
  interhash = {0bb7f0588cd690d67cc73e219a3a24fa},
  intrahash = {87d6883ebd98e8810be45d7e7e4ade96},
  isbn = {978-1-4614-1893-1},
  month = feb,
  publisher = {Springer},
  series = {SpringerBriefs in Electrical and Computer Engineering},
  title = {Recommender Systems for Social Tagging Systems},
  url = {http://link.springer.com/book/10.1007/978-1-4614-1894-8},
  year = 2012
}

@book{balbymarinho2012recommender,
  abstract = {Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the “noise” that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.},
  author = {Balby Marinho, L. and Hotho, A. and Jäschke, R. and Nanopoulos, A. and Rendle, S. and Schmidt-Thieme, L. and Stumme, G. and Symeonidis, P.},
  doi = {10.1007/978-1-4614-1894-8},
  interhash = {0bb7f0588cd690d67cc73e219a3a24fa},
  intrahash = {87d6883ebd98e8810be45d7e7e4ade96},
  isbn = {978-1-4614-1893-1},
  month = feb,
  publisher = {Springer},
  series = {SpringerBriefs in Electrical and Computer Engineering},
  title = {Recommender Systems for Social Tagging Systems},
  url = {http://link.springer.com/book/10.1007/978-1-4614-1894-8},
  year = 2012
}

@book{balbymarinho2012recommender,
  abstract = {Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the “noise” that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.},
  author = {Balby Marinho, L. and Hotho, A. and Jäschke, R. and Nanopoulos, A. and Rendle, S. and Schmidt-Thieme, L. and Stumme, G. and Symeonidis, P.},
  interhash = {0bb7f0588cd690d67cc73e219a3a24fa},
  intrahash = {87d6883ebd98e8810be45d7e7e4ade96},
  isbn = {978-1-4614-1893-1},
  month = feb,
  publisher = {Springer},
  series = {SpringerBriefs in Electrical and Computer Engineering},
  title = {Recommender Systems for Social Tagging Systems},
  url = {http://www.springer.com/computer/database+management+%26+information+retrieval/book/978-1-4614-1893-1},
  year = 2012
}

@book{balbymarinho2012recommender,
  abstract = {Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the “noise” that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.},
  author = {Balby Marinho, L. and Hotho, A. and Jäschke, R. and Nanopoulos, A. and Rendle, S. and Schmidt-Thieme, L. and Stumme, G. and Symeonidis, P.},
  doi = {10.1007/978-1-4614-1894-8},
  interhash = {0bb7f0588cd690d67cc73e219a3a24fa},
  intrahash = {87d6883ebd98e8810be45d7e7e4ade96},
  isbn = {978-1-4614-1893-1},
  month = feb,
  publisher = {Springer},
  series = {SpringerBriefs in Electrical and Computer Engineering},
  title = {Recommender Systems for Social Tagging Systems},
  url = {http://link.springer.com/book/10.1007/978-1-4614-1894-8},
  year = 2012
}

@article{cattuto2007,
  author = {Cattuto, C. and Schmitz, C. and Baldassarri, A. and Servedio, V. D. P. and Loreto, V. and Hotho, A. and Grahl, M. and Stumme, G.},
  interhash = {fc5f2df61d28bc99b7e15029da125588},
  intrahash = {d87e198a6d564ae8a8fe151e0a96fa0f},
  journal = {AI Communications},
  number = 4,
  pages = {245 - 262},
  title = {Network Properties of Folksonomies},
  url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2007/aicomm_2007_folksonomy_clustering.pdf},
  vgwort = {67},
  volume = 20,
  year = 2007
}

@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{stumme01conceptualclustering,
  address = {Universität Dortmund 763},
  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Lakhal, L.},
  booktitle = {Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)},
  editor = {Klinkenberg, R. and Rüping, S. and Fick, A. and Henze, N. and Herzog, C. and Molitor, R. and Schröder, O.},
  interhash = {c99f2ae002435208c58f9244d298a10b},
  intrahash = {f4ec21d5f63dbc213a3a6eae076c4b62},
  month = {October},
  title = {Conceptual Clustering with Iceberg Concept Lattices},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/FGML01.pdf},
  year = 2001
}

@inproceedings{hotho02conceptualclustering,
  author = {Hotho, A. and Stumme, G.},
  booktitle = {Proc. Fachgruppentreffen Maschinelles Lernen (FGML 2002)},
  comment = {alpha},
  editor = {K\'okai, G. and Zeidler, J.},
  interhash = {3dd3d4ce38d0de0ba8e167f8133cbb3e},
  intrahash = {e253c44552a046fe90236274bcfeab13},
  pages = {37-45},
  privnote = {alpha},
  title = {Conceptual Clustering of Text Clusters},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2002/FGML02.pdf},
  year = 2002
}

@article{benz2010academic,
  author = {Benz, D. and Hotho, A. and Jaschke, R. and Stumme, G. and Halle, A. and Lima, A. G. S. and Steenweg, H. and Stefani, S. and Lalmas, M. and Jose, J. and Rauber, A. and Sebastiani, F. and Frommholz, I.},
  interhash = {82f58238df3f0f36327daf86b54128cb},
  intrahash = {da1a070510ce488d2f5c75fb7d80b31d},
  journal = {LECTURE NOTES IN COMPUTER SCIENCE},
  month = {1},
  number = 6273,
  title = {Academic Publication Management with PUMA - Collect, Organize and Share Publications},
  uniqueid = {RN278581523|edsbl},
  year = 2010
}

@article{benz2010academic,
  author = {Benz, D. and Hotho, A. and Jaschke, R. and Stumme, G. and Halle, A. and Lima, A. G. S. and Steenweg, H. and Stefani, S. and Lalmas, M. and Jose, J. and Rauber, A. and Sebastiani, F. and Frommholz, I.},
  interhash = {82f58238df3f0f36327daf86b54128cb},
  intrahash = {da1a070510ce488d2f5c75fb7d80b31d},
  journal = {LECTURE NOTES IN COMPUTER SCIENCE},
  month = {1},
  number = 6273,
  title = {Academic Publication Management with PUMA - Collect, Organize and Share Publications},
  uniqueid = {RN278581523|edsbl},
  year = 2010
}

@incollection{Stumme95,
  author = {Stumme, G. and Wille, R.},
  booktitle = {Graph Drawing},
  editor = {Tamassia, R. and Tollis, I.G.},
  interhash = {0e3ac1bae7ef38507b1ff5b5bc6c4d49},
  intrahash = {e2ae749ca645c1526e7c76f752b03c87},
  pages = {452--459},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science, Vol. 894},
  title = {A geometrical heuristic for drawing concept lattices},
  year = 1995
}