@inproceedings{stumme2004iceberg,
  address = {Heidelberg},
  author = {Stumme, Gerd},
  booktitle = {Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)},
  comment = {alpha},
  editor = {Wolff, Karl Erich and Pfeiffer, Heather D. and Delugach, Harry S.},
  interhash = {5e81311b4e69d49a2f0aa7cd3f52b21d},
  intrahash = {70b05439d41b24c2476e9eba1f74ec87},
  pages = {109-125},
  publisher = {Springer},
  series = {LNCS},
  title = {Iceberg Query Lattices for Datalog},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2004/stumme2004iceberg.pdf},
  volume = 3127,
  year = 2004
}

@proceedings{stumme05semanticnetworkanalysis,
  address = {Aachen},
  editor = {Stumme, Gerd and Hoser, Bettina and Schmitz, Christoph and Alani, Harith},
  interhash = {6316cb226778a6a6f156821f975b2ba3},
  intrahash = {c44763991d44182c53606a2c93054f26},
  issn = {1613-0073},
  publisher = {CEUR Proceedings},
  title = {Proceedings of the First Workshop on Semantic Network Analysis },
  url = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-171/},
  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
}

@article{jaeschke08discovering,
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  interhash = {cfca594f9dbe30694bfbcdeb40dc4e88},
  intrahash = {eb0bdaeab0aa5d4c528c97e2b10770b9},
  journal = {Journal of Web Semantics},
  number = 1,
  pages = {38-53},
  title = {Discovering Shared Conceptualizations in Folksonomies},
  url = {http://dx.doi.org/10.1016/j.websem.2007.11.004},
  volume = 6,
  year = 2008
}

@inproceedings{jaeschke06trias,
  address = {Hong Kong},
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  booktitle = {Proceedings of the 6th IEEE International Conference on Data Mining     (ICDM 06)},
  doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2006.162},
  interhash = {b4964c3bdd2991a80873d7080ef6a73e},
  intrahash = {e387c294129e11f4221514d5fa807e26},
  isbn = {0-7695-2701-9},
  issn = {1550-4786},
  month = {December},
  pages = {907-911},
  publisher = {IEEE Computer Society},
  title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/jaeschke2006trias.pdf},
  vgwort = {19},
  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{ls_leimeister,
  address = {Valencia, Spain},
  author = {Sunyaev, A. and Leimeister, J. M. and Krcmar, H.},
  booktitle = {3. International Conference on Health Informatics (HealthInf) 2010},
  interhash = {f642f6edfcb26db12037f91540406935},
  intrahash = {c24c956a2d2f5471cfa7c8637baa2cd0},
  note = {162 (10-10)},
  title = {Open security issues in German healthcare telematics},
  url = {http://www.uni-kassel.de/fb7/ibwl/leimeister/pub/JML_155.pdf},
  year = 2010
}

@inproceedings{krause2008logsonomy,
  abstract = {Social bookmarking systems constitute an established
part of the Web 2.0. In such systems
users describe bookmarks by keywords
called tags. The structure behind these social
systems, called folksonomies, can be viewed
as a tripartite hypergraph of user, tag and resource
nodes. This underlying network shows
specific structural properties that explain its
growth and the possibility of serendipitous
exploration.
Today’s search engines represent the gateway
to retrieve information from the World Wide
Web. Short queries typically consisting of
two to three words describe a user’s information
need. In response to the displayed
results of the search engine, users click on
the links of the result page as they expect
the answer to be of relevance.
This clickdata can be represented as a folksonomy
in which queries are descriptions of
clicked URLs. The resulting network structure,
which we will term logsonomy is very
similar to the one of folksonomies. In order
to find out about its properties, we analyze
the topological characteristics of the tripartite
hypergraph of queries, users and bookmarks
on a large snapshot of del.icio.us and
on query logs of two large search engines.
All of the three datasets show small world
properties. The tagging behavior of users,
which is explained by preferential attachment
of the tags in social bookmark systems, is
reflected in the distribution of single query
words in search engines. We can conclude
that the clicking behaviour of search engine
users based on the displayed search results
and the tagging behaviour of social bookmarking
users is driven by similar dynamics.},
  address = {New York, NY, USA},
  author = {Krause, Beate and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd},
  booktitle = {HT '08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia},
  doi = {http://doi.acm.org/10.1145/1379092.1379123},
  interhash = {6d34ea1823d95b9dbf37d4db4d125d2a},
  intrahash = {e64d14f3207766f4afc65983fa759ffe},
  isbn = {978-1-59593-985-2},
  location = {Pittsburgh, PA, USA},
  pages = {157--166},
  publisher = {ACM},
  title = {Logsonomy - Social Information Retrieval with Logdata},
  url = {http://portal.acm.org/citation.cfm?id=1379092.1379123&coll=ACM&dl=ACM&type=series&idx=SERIES399&part=series&WantType=Journals&title=Proceedings%20of%20the%20nineteenth%20ACM%20conference%20on%20Hypertext%20and%20hypermedia},
  vgwort = {17},
  year = 2008
}

@inproceedings{mitzlaff2010visit,
  address = {Toronto, Canada},
  author = {Mitzlaff, Folke and Benz, Dominik and Stumme, Gerd and Hotho, Andreas},
  booktitle = {Proceedings of the 21st ACM conference on Hypertext and hypermedia},
  file = {mitzlaff2010visit.pdf:mitzlaff2010visit.pdf:PDF},
  interhash = {5584c4c57fcd8eb4663df8b114bcf09c},
  intrahash = {a97c4f7e80dcb666450acf697002155e},
  note = {(to appear)},
  title = {Visit me, click me, be my friend: An analysis of evidence networks of user relationships in Bibsonomy},
  url = {http://www.kde.cs.uni-kassel.de/pub/pdf/mitzlaff2010visit.pdf},
  year = 2010
}

@inproceedings{ADHMS:11,
  address = {to appear},
  author = {Atzmueller, Martin and Doerfel, Stephan and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd},
  booktitle = {Proc. Workshop on Mining Ubiquitous and Social Environments (MUSE 2011) at ECML/PKDD 2011},
  interhash = {49e97def917e352ca21ab2e3eb7bd88a},
  intrahash = {1fe037ea2712b205c564243d67840059},
  title = {{Face-to-Face Contacts during a Conference: Communities, Roles, and Key Players}},
  year = 2011
}

@article{bjrnelmarmacek2011profile,
  author = {{Björn-Elmar Macek, Martin Atzmueller, Gerd Stumme}},
  interhash = {1af59b6893ebc053e42bca152000c0a1},
  intrahash = {cb083b63f96664bcdba719391664c601},
  title = {Profile Mining in CVS-Logs and Face-to-Face Contacts for Recommending Software Developers},
  year = 2011
}