@inproceedings{jaeschke2009testing, abstract = {The challenge to provide tag recommendations for collaborative tagging systems has attracted quite some attention of researchers lately. However, most research focused on the evaluation and development of appropriate methods rather than tackling the practical challenges of how to integrate recommendation methods into real tagging systems, record and evaluate their performance. In this paper we describe the tag recommendation framework we developed for our social bookmark and publication sharing system BibSonomy. With the intention to develop, test, and evaluate recommendation algorithms and supporting cooperation with researchers, we designed the framework to be easily extensible, open for a variety of methods, and usable independent from BibSonomy. Furthermore, this paper presents a �rst evaluation of two exemplarily deployed recommendation methods.}, address = {New York, NY, USA}, author = {Jäschke, Robert and Eisterlehner, Folke and Hotho, Andreas and Stumme, Gerd}, booktitle = {RecSys '09: Proceedings of the 2009 ACM Conference on Recommender Systems}, interhash = {440fafda1eccf4036066f457eb6674a0}, intrahash = {1320904b208d53bd5d49e751cbfcc268}, location = {New York, NY, USA}, note = {(to appear)}, publisher = {ACM}, title = {Testing and Evaluating Tag Recommenders in a Live System}, year = 2009 } @phdthesis{jaschke2011formal, address = {Heidelberg}, author = {Jäschke, Robert}, interhash = {dcb2cd1cd72ae45d77c4d8755d199405}, intrahash = {bad02a0bbbf066907ecdee0ecaf9fb80}, isbn = {1-60750-707-2}, publisher = {Akad. Verl.-Ges. AKA}, series = {Dissertations in artificial intelligence}, title = {Formal concept analysis and tag recommendations in collaborative tagging systems}, url = {http://opac.bibliothek.uni-kassel.de/DB=1/PPN?PPN=231779038}, volume = 332, year = 2011 } @inproceedings{mueller2013recommendations, abstract = {With the rising popularity of smart mobile devices, sensor data-based applications have become more and more popular. Their users record data during their daily routine or specifically for certain events. The application WideNoise Plus allows users to record sound samples and to annotate them with perceptions and tags. The app is being used to document and map the soundscape all over the world. The procedure of recording, including the assignment of tags, has to be as easy-to-use as possible. We therefore discuss the application of tag recommender algorithms in this particular scenario. We show, that this task is fundamentally different from the well-known tag recommendation problem in folksonomies as users do no longer tag fix resources but rather sensory data and impressions. The scenario requires efficient recommender algorithms that are able to run on the mobile device, since Internet connectivity cannot be assumed to be available. Therefore, we evaluate the performance of several tag recommendation algorithms and discuss their applicability in the mobile sensing use-case.}, address = {Aachen, Germany}, author = {Mueller, Juergen and Doerfel, Stephan and Becker, Martin and Hotho, Andreas and Stumme, Gerd}, booktitle = {Recommender Systems and the Social Web Workshop at 7th ACM Conference on Recommender Systems, RecSys 2013, Hong Kong, China -- October 12-16, 2013. Proceedings}, interhash = {23d1cf49208d9a0c8b883dc69d4e444d}, intrahash = {2bab3f013052bc741e795c5c61aea5c9}, issn = {1613-0073}, publisher = {CEUR-WS}, title = {Tag Recommendations for SensorFolkSonomies}, url = {http://ceur-ws.org/Vol-1066/}, volume = 1066, 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 } @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 } @mastersthesis{bottger2012konzept, abstract = {Kollaborative Verschlagwortungssysteme bieten Nutzern die Möglichkeit zur freien Verschlagwortung von Ressourcen im World Wide Web. Sie ermöglichen dem Nutzer beliebige Ressourcen mit frei wählbaren Schlagwörtern – so genannten Tags – zu versehen (Social Tagging). Im weiteren Sinne ist Social Tagging nichts anderes als das Indexieren von Ressourcen durch die Nutzenden selbst. Dabei sind die Tag-Zuordnungen für den einzelnen Nutzer und für die gesamte Community in vielerlei Hinsicht hilfreich. So können durch Tags persönliche Ideen oder Wertungen für eine Ressource ausgedrückt werden. Außerdem können Tags als Kommunikationsmittel von den Nutzern oder Nutzergruppen untereinander verwendet werden. Tags helfen zudem bei der Navigation, beim Suchen und beim zufälligen Entdecken von neuen Ressourcen. Das Verschlagworten der Ressourcen ist für unbedarfte Anwender eine kognitiv anspruchsvolle Aufgabe. Als Unterstützung können Tag-Recommender eingesetzt werden, die Nutzern passende Tags vorschlagen sollen. UniVideo ist das Videoportal der Universität Kassel, das jedem Mitglied der Hochschule ermöglicht Videos bereitzustellen und weltweit über das WWW abrufbar zu machen. Die bereitgestellten Videos müssen von ihren Eigentümern beim Hochladen verschlagwortet werden. Die dadurch entstehende Struktur dient wiederum als Grundlage für die Navigation in UniVideo. In dieser Arbeit werden vier verschiedene Ansätze für Tag-Recommender theoretisch diskutiert und deren praktische Umsetzung für UniVideo untersucht und bewertet. Dabei werden zunächst die Grundlagen des Social Taggings erläutert und der Aufbau von UniVideo erklärt, bevor die Umsetzung der vier einzelnen Tag-Recommender beschrieben wird. Anschließend wird gezeigt wie aus den einzelnen Tag-Recommendern durch Verschmelzung ein hybrider Tag-Recommender umgesetzt werden kann.}, address = {Kassel}, author = {Böttger, Sebastian}, interhash = {8fd8ce9278d61f8bd5292d7aeab9aacd}, intrahash = {3c2ffd52e7081b66bf420f993d9144bb}, month = {04}, school = {Universität Kassel}, title = {Konzept und Umsetzung eines Tag-Recommenders für Video-Ressourcen am Beispiel UniVideo}, type = {Bachelor Thesis}, url = {http://www.uni-kassel.de/~seboettg/ba-thesis.pdf}, 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 } @inproceedings{rendle2010pairwise, abstract = {Tagging plays an important role in many recent websites. Recommender systems can help to suggest a user the tags he might want to use for tagging a specific item. Factorization models based on the Tucker Decomposition (TD) model have been shown to provide high quality tag recommendations outperforming other approaches like PageRank, FolkRank, collaborative filtering, etc. The problem with TD models is the cubic core tensor resulting in a cubic runtime in the factorization dimension for prediction and learning.

In this paper, we present the factorization model PITF (Pairwise Interaction Tensor Factorization) which is a special case of the TD model with linear runtime both for learning and prediction. PITF explicitly models the pairwise interactions between users, items and tags. The model is learned with an adaption of the Bayesian personalized ranking (BPR) criterion which originally has been introduced for item recommendation. Empirically, we show on real world datasets that this model outperforms TD largely in runtime and even can achieve better prediction quality. Besides our lab experiments, PITF has also won the ECML/PKDD Discovery Challenge 2009 for graph-based tag recommendation.}, acmid = {1718498}, address = {New York, NY, USA}, author = {Rendle, Steffen and Schmidt-Thieme, Lars}, booktitle = {Proceedings of the third ACM international conference on Web search and data mining}, doi = {10.1145/1718487.1718498}, interhash = {ce8fbdf2afb954579cdb58104fb683a7}, intrahash = {10fe730b391b08031f3103f9cdbb6e1a}, isbn = {978-1-60558-889-6}, location = {New York, New York, USA}, numpages = {10}, pages = {81--90}, publisher = {ACM}, title = {Pairwise interaction tensor factorization for personalized tag recommendation}, url = {http://doi.acm.org/10.1145/1718487.1718498}, year = 2010 } @incollection{gemmell2010resource, abstract = {Collaborative tagging applications enable users to annotate online resources with user-generated keywords. The collection of these annotations and the way they connect users and resources produce a rich information space for users to explore. However the size, complexity and chaotic structure of these systems hamper users as they search for information. Recommenders can assist the user by suggesting resources, tags or even other users. Previous work has demonstrated that an integrative approach which exploits all three dimensions of the data (users, resources, tags) produce superior results in tag recommendation. We extend this integrative philosophy to resource recommendation. Specifically, we propose an approach for designing weighted linear hybrid resource recommenders. Through extensive experimentation on two large real world datasets, we show that the hybrid recommenders surpass the effectiveness of their constituent components while inheriting their simplicity, computational efficiency and explanatory capacity. We further introduce the notion of information channels which describe the interaction of the three dimensions. Information channels can be used to explain the effectiveness of individual recommenders or explain the relative contribution of components in the hybrid recommender.}, address = {Berlin/Heidelberg}, affiliation = {Center for Web Intelligence, School of Computing, DePaul University, Chicago, Illinois USA}, author = {Gemmell, Jonathan and Schimoler, Thomas and Mobasher, Bamshad and Burke, Robin}, booktitle = {E-Commerce and Web Technologies}, doi = {10.1007/978-3-642-15208-5_1}, editor = {Buccafurri, Francesco and Semeraro, Giovanni}, interhash = {357183305397b19624ec246b915df6ac}, intrahash = {684579385b3a4f90f5b41ce7c92ddb2a}, isbn = {978-3-642-15208-5}, keyword = {Computer Science}, pages = {1--12}, publisher = {Springer}, series = {Lecture Notes in Business Information Processing}, title = {Resource Recommendation in Collaborative Tagging Applications}, url = {http://dx.doi.org/10.1007/978-3-642-15208-5_1}, volume = 61, year = 2010 } @inproceedings{parra2009evaluation, abstract = {Motivated by the potential use of collaborative tagging systems to develop new recommender systems, we have implemented and compared three variants of user-based collaborative filtering algorithms to provide recommendations of articles on CiteULike. On our first approach, Classic Collaborative filtering (CCF), we use Pearson correlation to calculate similarity between users and a classic adjusted ratings formula to rank the recommendations. Our second approach, Neighbor-weighted Collaborative Filtering (NwCF), incorporates the amount of raters in the ranking formula of the recommendations. A modified version of the Okapi BM25 IR model over users ’ tags is implemented on our third approach to form the user neighborhood. Our results suggest that incorporating the number of raters into the algorithms leads to an improvement of precision, and they also support that tags can be considered as an alternative to Pearson correlation to calculate the similarity between users and their neighbors in a collaborative tagging system. }, author = {Parra, Denis and Brusilovsky, Peter}, booktitle = {Proceedings of the Workshop on Web 3.0: Merging Semantic Web and Social Web}, interhash = {03a51e24ecab3ad66fcc381980144fea}, intrahash = {42773258c36ccf2f59749991518d1784}, issn = {1613-0073}, location = {Torino, Italy}, month = jun, series = {CEUR Workshop Proceedings}, title = {Evaluation of Collaborative Filtering Algorithms for Recommending Articles on CiteULike}, url = {http://ceur-ws.org/Vol-467/paper5.pdf}, volume = 467, year = 2009 } @inproceedings{lee2010using, abstract = {This paper aims to combine information about users' self-defined social connections with traditional collaborative filtering (CF) to improve recommendation quality. Specifically, in the following, the users' social connections in consideration were groups. Unlike other studies which utilized groups inferred by data mining technologies, we used the information about the groups in which each user explicitly participated. The group activities are centered on common interests. People join a group to share and acquire information about a topic as a form of community of interest or practice. The information of this group activity may be a good source of information for the members. We tested whether adding the information from the users' own groups or group members to the traditional CF-based recommendations can improve the recommendation quality or not. The information about groups was combined with CF using a mixed hybridization strategy. We evaluated our approach in two ways, using the Citeulike data set and a real user study.}, acmid = {1864752}, address = {New York, NY, USA}, author = {Lee, Danielle H. and Brusilovsky, Peter}, booktitle = {Proceedings of the fourth ACM conference on Recommender systems}, doi = {10.1145/1864708.1864752}, interhash = {6fd1cbcfd94da174c910d9144467372a}, intrahash = {ec592568ca4a9f6b2ebaf41816af1ebc}, isbn = {978-1-60558-906-0}, location = {Barcelona, Spain}, numpages = {4}, pages = {221--224}, publisher = {ACM}, title = {Using self-defined group activities for improving recommendations in collaborative tagging systems}, url = {http://doi.acm.org/10.1145/1864708.1864752}, year = 2010 } @inproceedings{pera2011personalized, abstract = {Researchers, as well as ordinary users who seek information in diverse academic fields, turn to the web to search for publications of interest. Even though scholarly publication recommenders have been developed to facilitate the task of discovering literature pertinent to their users, they (i) are not personalized enough to meet users' expectations, since they provide the same suggestions to users sharing similar profiles/preferences, (ii) generate recommendations pertaining to each user's general interests as opposed to the specific need of the user, and (iii) fail to take full advantages of valuable user-generated data at social websites that can enhance their performance. To address these problems, we propose PubRec, a recommender that suggests closely-related references to a particular publication P tailored to a specific user U, which minimizes the time and efforts imposed on U in browsing through general recommended publications. Empirical studies conducted using data extracted from CiteULike (i) verify the efficiency of the recommendation and ranking strategies adopted by PubRec and (ii) show that PubRec significantly outperforms other baseline recommenders.}, acmid = {2063908}, address = {New York, NY, USA}, author = {Pera, Maria Soledad and Ng, Yiu-Kai}, booktitle = {Proceedings of the 20th ACM international conference on Information and knowledge management}, doi = {10.1145/2063576.2063908}, interhash = {c3878647328db1e4b665dbf65547ba92}, intrahash = {d335b38783be877ea4e000e0c332cef4}, isbn = {978-1-4503-0717-8}, location = {Glasgow, Scotland, UK}, numpages = {4}, pages = {2133--2136}, publisher = {ACM}, title = {A personalized recommendation system on scholarly publications}, url = {http://doi.acm.org/10.1145/2063576.2063908}, year = 2011 } @incollection{cantador2011semantic, abstract = {We present an approach that efficiently identifies the semantic meanings and contexts of social tags within a particular folksonomy, and exploits them to build contextualised tag-based user and item profiles. We apply our approach to a dataset obtained from Delicious social bookmarking system, and evaluate it through two experiments: a user study consisting of manual judgements of tag disambiguation and contextualisation cases, and an offline study measuring the performance of several tag-powered item recommendation algorithms by using contextualised profiles. The results obtained show that our approach is able to accurately determine the actual semantic meanings and contexts of tag annotations, and allow item recommenders to achieve better precision and recall on their predictions.}, address = {Berlin/Heidelberg}, affiliation = {Departamento de Ingeniería Informática, Universidad Autónoma de Madrid, 28049 Madrid, Spain}, author = {Cantador, Iván and Bellogín, Alejandro and Fernández-Tobías, Ignacio and López-Hernández, Sergio}, booktitle = {E-Commerce and Web Technologies}, doi = {10.1007/978-3-642-23014-1_9}, editor = {Huemer, Christian and Setzer, Thomas and Aalst, Wil and Mylopoulos, John and Rosemann, Michael and Shaw, Michael J. and Szyperski, Clemens}, interhash = {b2359e659cf8c02ba8e9fc8db014aafc}, intrahash = {ac6d55bacc85f75a4711a1c48526dfd6}, isbn = {978-3-642-23014-1}, keyword = {Computer Science}, pages = {101--113}, publisher = {Springer}, series = {Lecture Notes in Business Information Processing}, title = {Semantic Contextualisation of Social Tag-Based Profiles and Item Recommendations}, url = {http://dx.doi.org/10.1007/978-3-642-23014-1_9}, volume = 85, year = 2011 } @incollection{wartena2011improving, abstract = {Collaborative tagging has emerged as a mechanism to describe items in large on-line collections. Tags are assigned by users to describe and find back items, but it is also tempting to describe the users in terms of the tags they assign or in terms of the tags of the items they are interested in. The tag-based profile thus obtained can be used to recommend new items. If we recommend new items by computing their similarity to the user profile or to all items seen by the user, we run into the risk of recommending only neutral items that are a bit relevant for each topic a user is interested in. In order to increase user satisfaction many recommender systems not only optimize for accuracy but also for diversity. Often it is assumed that there exists a trade-off between accuracy and diversity. In this paper we introduce topic aware recommendation algorithms. Topic aware algorithms first detect different interests in the user profile and then generate recommendations for each of these interests. We study topic aware variants of three tag based recommendation algorithms and show that each of them gives better recommendations than their base variants, both in terms of precision and recall and in terms of diversity.}, address = {Berlin/Heidelberg}, affiliation = {Novay, Brouwerijstraat 1, 7523 XC Enschede, The Netherlands}, author = {Wartena, Christian and Wibbels, Martin}, booktitle = {Advances in Information Retrieval}, doi = {10.1007/978-3-642-20161-5_7}, editor = {Clough, Paul and Foley, Colum and Gurrin, Cathal and Jones, Gareth and Kraaij, Wessel and Lee, Hyowon and Mudoch, Vanessa}, interhash = {9bdec52c6a5e56fb68b0553440b217df}, intrahash = {fd9284874d7896d3aee8a9641efe368a}, isbn = {978-3-642-20160-8}, keyword = {Computer Science}, pages = {43--54}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Improving Tag-Based Recommendation by Topic Diversification}, url = {http://dx.doi.org/10.1007/978-3-642-20161-5_7}, volume = 6611, year = 2011 } @inproceedings{wetzker2010translating, abstract = {Collaborative tagging services (folksonomies) have been among the stars of the Web 2.0 era. They allow their users to label diverse resources with freely chosen keywords (tags). Our studies of two real-world folksonomies unveil that individual users develop highly personalized vocabularies of tags. While these meet individual needs and preferences, the considerable differences between personal tag vocabularies (personomies) impede services such as social search or customized tag recommendation. In this paper, we introduce a novel user-centric tag model that allows us to derive mappings between personal tag vocabularies and the corresponding folksonomies. Using these mappings, we can infer the meaning of user-assigned tags and can predict choices of tags a user may want to assign to new items. Furthermore, our translational approach helps in reducing common problems related to tag ambiguity, synonymous tags, or multilingualism. We evaluate the applicability of our method in tag recommendation and tag-based social search. Extensive experiments show that our translational model improves the prediction accuracy in both scenarios.}, acmid = {1718497}, address = {New York, NY, USA}, author = {Wetzker, Robert and Zimmermann, Carsten and Bauckhage, Christian and Albayrak, Sahin}, booktitle = {Proceedings of the third ACM international conference on Web search and data mining}, doi = {10.1145/1718487.1718497}, interhash = {12e89c88182a393dae8d63287f65540d}, intrahash = {224e7bdc753e1823fc17828f2c760b6e}, isbn = {978-1-60558-889-6}, location = {New York, New York, USA}, numpages = {10}, pages = {71--80}, publisher = {ACM}, series = {WSDM '10}, title = {I tag, you tag: translating tags for advanced user models}, url = {http://doi.acm.org/10.1145/1718487.1718497}, year = 2010 } @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 } @incollection{jaeschke2012challenges, abstract = {Originally introduced by social bookmarking systems, collaborative tagging, or social tagging, has been widely adopted by many web-based systems like wikis, e-commerce platforms, or social networks. Collaborative tagging systems allow users to annotate resources using freely chosen keywords, so called tags . Those tags help users in finding/retrieving resources, discovering new resources, and navigating through the system. The process of tagging resources is laborious. Therefore, most systems support their users by tag recommender components that recommend tags in a personalized way. The Discovery Challenges 2008 and 2009 of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) tackled the problem of tag recommendations in collaborative tagging systems. Researchers were invited to test their methods in a competition on datasets from the social bookmark and publication sharing system BibSonomy. Moreover, the 2009 challenge included an online task where the recommender systems were integrated into BibSonomy and provided recommendations in real time. In this chapter we review, evaluate and summarize the submissions to the two Discovery Challenges and thus lay the groundwork for continuing research in this area.}, address = {Berlin/Heidelberg}, affiliation = {Knowledge & Data Engineering Group, University of Kassel, Wilhelmshöher Allee 73, 34121 Kassel, Germany}, author = {Jäschke, Robert and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd}, booktitle = {Recommender Systems for the Social Web}, doi = {10.1007/978-3-642-25694-3_3}, editor = {Pazos Arias, José J. and Fernández Vilas, Ana and Díaz Redondo, Rebeca P.}, interhash = {75b1a6f54ef54d0126d0616b5bf77563}, intrahash = {7d41d332cccc3e7ba8e7dadfb7996337}, isbn = {978-3-642-25694-3}, pages = {65--87}, publisher = {Springer}, series = {Intelligent Systems Reference Library}, title = {Challenges in Tag Recommendations for Collaborative Tagging Systems}, url = {http://dx.doi.org/10.1007/978-3-642-25694-3_3}, volume = 32, year = 2012 } @incollection{jaeschke2012challenges, abstract = {Originally introduced by social bookmarking systems, collaborative tagging, or social tagging, has been widely adopted by many web-based systems like wikis, e-commerce platforms, or social networks. Collaborative tagging systems allow users to annotate resources using freely chosen keywords, so called tags . Those tags help users in finding/retrieving resources, discovering new resources, and navigating through the system. The process of tagging resources is laborious. Therefore, most systems support their users by tag recommender components that recommend tags in a personalized way. The Discovery Challenges 2008 and 2009 of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) tackled the problem of tag recommendations in collaborative tagging systems. Researchers were invited to test their methods in a competition on datasets from the social bookmark and publication sharing system BibSonomy. Moreover, the 2009 challenge included an online task where the recommender systems were integrated into BibSonomy and provided recommendations in real time. In this chapter we review, evaluate and summarize the submissions to the two Discovery Challenges and thus lay the groundwork for continuing research in this area.}, address = {Berlin/Heidelberg}, affiliation = {Knowledge & Data Engineering Group, University of Kassel, Wilhelmshöher Allee 73, 34121 Kassel, Germany}, author = {Jäschke, Robert and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd}, booktitle = {Recommender Systems for the Social Web}, doi = {10.1007/978-3-642-25694-3_3}, editor = {Pazos Arias, José J. and Fernández Vilas, Ana and Díaz Redondo, Rebeca P.}, interhash = {75b1a6f54ef54d0126d0616b5bf77563}, intrahash = {7d41d332cccc3e7ba8e7dadfb7996337}, isbn = {978-3-642-25694-3}, pages = {65--87}, publisher = {Springer}, series = {Intelligent Systems Reference Library}, title = {Challenges in Tag Recommendations for Collaborative Tagging Systems}, url = {http://dx.doi.org/10.1007/978-3-642-25694-3_3}, volume = 32, year = 2012 }