@incollection{niebler2013tagging,
  abstract = {The presence of emergent semantics in social annotation systems has been reported in numerous studies. Two important problems in this context are the induction of semantic relations among tags and the discovery of different senses of a given tag. While a number of approaches for discovering tag senses exist, little is known about which },
  author = {Niebler, Thomas and Singer, Philipp and Benz, Dominik and Körner, Christian and Strohmaier, Markus and Hotho, Andreas},
  booktitle = {Advances in Information Retrieval},
  doi = {10.1007/978-3-642-36973-5_8},
  editor = {Serdyukov, Pavel and Braslavski, Pavel and Kuznetsov, SergeiO. and Kamps, Jaap and Rüger, Stefan and Agichtein, Eugene and Segalovich, Ilya and Yilmaz, Emine},
  interhash = {8f11f2140d9eb369a7ca42cd527f76c1},
  intrahash = {8583743a7598e78cc7b4e8af71a43902},
  isbn = {978-3-642-36972-8},
  pages = {86-97},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {How Tagging Pragmatics Influence Tag Sense Discovery in Social Annotation Systems},
  url = {http://dx.doi.org/10.1007/978-3-642-36973-5_8},
  volume = 7814,
  year = 2013
}

@article{landia2013deeper,
  abstract = {The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.},
  author = {Landia, Nikolas and Doerfel, Stephan and Jäschke, Robert and Anand, Sarabjot Singh and Hotho, Andreas and Griffiths, Nathan},
  interhash = {e8095b13630452ce3ecbae582f32f4bc},
  intrahash = {e585a92994be476480545eb62d741642},
  journal = {cs.IR},
  title = {Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations},
  url = {http://arxiv.org/abs/1310.1498},
  volume = {1310.1498},
  year = 2013
}

@inproceedings{doerfel2013analysis,
  abstract = {Since the rise of collaborative tagging systems on the web, the tag recommendation task -- suggesting suitable tags to users of such systems while they add resources to their collection -- has been tackled. However, the (offline) evaluation of tag recommendation algorithms usually suffers from difficulties like the sparseness of the data or the cold start problem for new resources or users. Previous studies therefore often used so-called post-cores (specific subsets of the original datasets) for their experiments. In this paper, we conduct a large-scale experiment in which we analyze different tag recommendation algorithms on different cores of three real-world datasets. We show, that a recommender's performance depends on the particular core and explore correlations between performances on different cores.},
  acmid = {2507222},
  address = {New York, NY, USA},
  author = {Doerfel, Stephan and Jäschke, Robert},
  booktitle = {Proceedings of the 7th ACM conference on Recommender systems},
  doi = {10.1145/2507157.2507222},
  interhash = {3eaf2beb1cdad39b7c5735a82c3338dd},
  intrahash = {aa4b3d79a362d7415aaa77625b590dfa},
  isbn = {978-1-4503-2409-0},
  location = {Hong Kong, China},
  numpages = {4},
  pages = {343--346},
  publisher = {ACM},
  series = {RecSys '13},
  title = {An analysis of tag-recommender evaluation procedures},
  url = {https://www.kde.cs.uni-kassel.de/pub/pdf/doerfel2013analysis.pdf},
  year = 2013
}

@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{journals/insk/KrauseLHRS12,
  author = {Krause, Beate and Lerch, Hana and Hotho, Andreas and Roßnagel, Alexander and Stumme, Gerd},
  ee = {http://dx.doi.org/10.1007/s00287-010-0485-8},
  interhash = {3fca17b13ee1c002f41d3a2a4594b3e2},
  intrahash = {df97de393d3421ef2e20384ddde16ab1},
  journal = {Informatik Spektrum},
  number = 1,
  pages = {12-23},
  title = {Datenschutz im Web 2.0 am Beispiel des sozialen Tagging-Systems BibSonomy.},
  url = {http://dblp.uni-trier.de/db/journals/insk/insk35.html#KrauseLHRS12},
  volume = 35,
  year = 2012
}