@inproceedings{illig2009comparison, abstract = {Recommendation algorithms and multi-class classifiers can support users of social bookmarking systems in assigning tags to their bookmarks. Content based recommenders are the usual approach for facing the cold start problem, i.e., when a bookmark is uploaded for the first time and no information from other users can be exploited. In this paper, we evaluate several recommendation algorithms in a cold-start scenario on a large real-world dataset. }, address = {Berlin/Heidelberg}, author = {Illig, Jens and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd}, booktitle = {Knowledge Processing and Data Analysis}, doi = {10.1007/978-3-642-22140-8_9}, editor = {Wolff, Karl Erich and Palchunov, Dmitry E. and Zagoruiko, Nikolay G. and Andelfinger, Urs}, interhash = {cd3420c0f73761453320dc528b3d1e14}, intrahash = {f9d6e06ab0f2fdcebb77afa97d72e40a}, isbn = {978-3-642-22139-2}, pages = {136--149}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {A Comparison of Content-Based Tag Recommendations in Folksonomy Systems}, url = {http://dx.doi.org/10.1007/978-3-642-22140-8_9}, vgwort = {23}, volume = 6581, year = 2011 } @inproceedings{illig2009comparison, abstract = {Recommendation algorithms and multi-class classifiers can support users of social bookmarking systems in assigning tags to their bookmarks. Content based recommenders are the usual approach for facing the cold start problem, i.e., when a bookmark is uploaded for the first time and no information from other users can be exploited. In this paper, we evaluate several recommendation algorithms in a cold-start scenario on a large real-world dataset. }, address = {Berlin/Heidelberg}, author = {Illig, Jens and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd}, booktitle = {Knowledge Processing and Data Analysis}, doi = {10.1007/978-3-642-22140-8_9}, editor = {Wolff, Karl Erich and Palchunov, Dmitry E. and Zagoruiko, Nikolay G. and Andelfinger, Urs}, interhash = {cd3420c0f73761453320dc528b3d1e14}, intrahash = {f9d6e06ab0f2fdcebb77afa97d72e40a}, isbn = {978-3-642-22139-2}, pages = {136--149}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {A Comparison of Content-Based Tag Recommendations in Folksonomy Systems}, url = {http://dx.doi.org/10.1007/978-3-642-22140-8_9}, volume = 6581, year = 2011 } @inproceedings{illig2011comparison, author = {Illig, Jens and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd}, booktitle = {Postproceedings of the International Conference on Knowledge Processing in Practice (KPP 2007)}, interhash = {cd3420c0f73761453320dc528b3d1e14}, intrahash = {0a4a7f95efa9493d804816bb75ecbf33}, publisher = {Springer}, title = {A Comparison of content-based Tag Recommendations in Folksonomy Systems}, year = 2011 } @inproceedings{illigtoappearcomparison, author = {Illig, Jens and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd}, booktitle = {Postproceedings of the International Conference on Knowledge Processing in Practice (KPP2007)}, file = {:illig2009comparison.pdf:PDF}, interhash = {849cc8141815da667268acd7389d610a}, intrahash = {65f66d8e45722648f0471a193dd8ead6}, publisher = {Springer}, title = {A Comparison of content-based Tag Recommendations in Folksonomy Systems}, year = {to appear} } @inproceedings{widdows2002graph, author = {Widdows, Dominic and Dorow, Beate}, bibsource = {DBLP, http://dblp.uni-trier.de}, booktitle = {COLING}, ee = {http://acl.ldc.upenn.edu/C/C02/C02-1114.pdf}, interhash = {778db99ef80f4b5a682eb6923cc0eb13}, intrahash = {a16325d6196b3adb8e68851f4f4eff84}, title = {A Graph Model for Unsupervised Lexical Acquisition}, year = 2002 } @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 = {a73213a865503252caa4b28e88a77108}, 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 = {http://doi.acm.org/10.1145/2507157.2507222}, 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 = {a73213a865503252caa4b28e88a77108}, 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 = {http://doi.acm.org/10.1145/2507157.2507222}, year = 2013 } @inproceedings{musto2010combining, abstract = {The explosion of collaborative platforms we are recently witnessing, such as social networks, or video and photo sharing sites, radically changed the Web dynamics and the way people use and organize information. The use of tags, keywords freely chosen by users for annotating resources, offers a new way for organizing and retrieving web resources that closely reflects the users' mental model and also allows the use of evolving vocabularies. However, since tags are handled in a purely syntactical way, the annotations provided by users generate a very sparse and noisy tag space that limits the effectiveness of tag-based approaches for complex tasks. Consequently, systems called tag recommenders recently emerged, with the purpose of speeding up the so-called tag convergence, providing users with the most suitable tags for the resource to be annotated. This paper presents a tag recommender system called STaR (Social Tag Recommender), which extends the social approach presented in a previous work [14] with a content-based approach able to extract tags directly from the textual content of HTML pages. Results of experiments carried out on a large dataset gathered from Bibsonomy, show that the use of content-based techniques improves the predictive accuracy of the tag recommender. }, address = {Berlin/Heidelberg}, author = {Musto, Cataldo and Narducci, Fedelucio and Lops, Pasquale and de Gemmis, Marco}, booktitle = {E-Commerce and Web Technologies}, doi = {10.1007/978-3-642-15208-5_2}, editor = {Buccafurri, Francesco and Semeraro, Giovanni}, interhash = {60254c70491f83c365ee71b019d65344}, intrahash = {bdd023e357c901c749580d038b4f2059}, isbn = {978-3-642-15207-8}, pages = {13--23}, publisher = {Springer}, series = {Lecture Notes in Business Information Processing}, title = {Combining Collaborative and Content-Based Techniques for Tag Recommendation.}, url = {http://dx.doi.org/10.1007/978-3-642-15208-5_2}, volume = 61, year = 2010 } @inproceedings{xi2009content, author = {Si, Xiance and Liu, Zhiyuan and Li, Peng and Jiang, Qixia and Sun, Maosong}, crossref = {eisterlehner2009ecmlpkdd}, editor = {Eisterlehner, Folke and Hotho, Andreas and Jäschke, Robert}, interhash = {060d0b9532600a70bccbabd8628f64a9}, intrahash = {de2233e0713a1cefbf5f5ccde074e31d}, issn = {1613-0073}, month = {September}, pages = {243--260}, series = {CEUR-WS.org}, title = {Content-based and Graph-based Tag Suggestion}, volume = 497, year = 2009 } @misc{illig2006entwurf, author = {Illig, Jens}, howpublished = {Project report}, institution = {Fachgebiet Wissensverarbeitung, Universität Kassel}, interhash = {cb0aab1eb647c26b0b26b0edf74dd24a}, intrahash = {7c95058aa4c600d11c80319a07e94878}, title = {Entwurf und Integration eines Item-Based Collaborative Filtering Tag Recommender Systems in das BibSonomy-Projekt}, url = {http://www.kde.cs.uni-kassel.de/lehre/arbeiten/documents/illig2006entwurf.pdf}, year = 2006 } @inproceedings{markines2009evaluating, abstract = {Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question for harvesting semantics from these systems is how to extend and adapt traditional notions of similarity to folksonomies, and which measures are best suited for applications such as navigation support, semantic search, and ontology learning. Here we build an evaluation framework to compare various general folksonomy-based similarity measures derived from established information-theoretic, statistical, and practical measures. Our framework deals generally and symmetrically with users, tags, and resources. For evaluation purposes we focus on similarity among tags and resources, considering different ways to aggregate annotations across users. After comparing how tag similarity measures predict user-created tag relations, we provide an external grounding by user-validated semantic proxies based on WordNet and the Open Directory. We also investigate the issue of scalability. We ?nd that mutual information with distributional micro-aggregation across users yields the highest accuracy, but is not scalable; per-user projection with collaborative aggregation provides the best scalable approach via incremental computations. The results are consistent across resource and tag similarity.}, author = {Markines, Benjamin and Cattuto, Ciro and Menczer, Filippo and Benz, Dominik and Hotho, Andreas and Stumme, Gerd}, booktitle = {18th International World Wide Web Conference}, interhash = {a266558ad4d83d536a0be2ac94b6b7df}, intrahash = {d16e752a8295d5dad7e26b199d9f614f}, month = {April}, pages = {641--650}, title = {Evaluating Similarity Measures for Emergent Semantics of Social Tagging}, url = {http://www2009.eprints.org/65/}, year = 2009 } @phdthesis{jschke2011formal, address = {[Amsterdam]}, author = {Jäschke, Robert}, interhash = {dcb2cd1cd72ae45d77c4d8755d199405}, intrahash = {1ac91a922a872523de0ce8d4984e53a3}, isbn = {9781607507079 1607507072 9783898383325 3898383326}, pages = {--}, publisher = {IOS Press}, refid = {707172013}, title = {Formal concept analysis and tag recommendations in collaborative tagging systems}, url = {http://www.worldcat.org/search?qt=worldcat_org_all&q=9783898383325}, year = 2011 } @book{jaeschke2011formal, abstract = {One of the most noticeable innovation that emerged with the advent of the Web 2.0 and the focal point of this thesis are collaborative tagging systems. They allow users to annotate arbitrary resources with freely chosen keywords, so called tags. The tags are used for navigation, finding resources, and serendipitous browsing and thus provide an immediate benefit for the user. By now, several systems for tagging photos, web links, publication references, videos, etc. have attracted millions of users which in turn annotated countless resources. Tagging gained so much popularity that it spread into other applications like web browsers, software packet managers, and even file systems. Therefore, the relevance of the methods presented in this thesis goes beyond the Web 2.0. The conceptual structure underlying collaborative tagging systems is called folksonomy. It can be represented as a tripartite hypergraph with user, tag, and resource nodes. Each edge of the graph expresses the fact that a user annotated a resource with a tag. This social network constitutes a lightweight conceptual structure that is not formalized, but rather implicit and thus needs to be extracted with knowledge discovery methods. In this thesis a new data mining task – the mining of all frequent tri-concepts – is presented, together with an efficient algorithm for discovering such implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. Extending the theory of triadic Formal Concept Analysis, we provide a formal definition of the problem, and present an efficient algorithm for its solution. We show the applicability of our approach on three large real-world examples and thereby perform a conceptual clustering of two collaborative tagging systems. Finally, we introduce neighborhoods of triadic concepts as basis for a lightweight visualization of tri-lattices. The social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind, has been developed by our research group. Besides being a useful tool for many scientists, it provides interested researchers a basis for the evaluation and integration of their knowledge discovery methods. This thesis introduces BibSonomy as an exemplary collaborative tagging system and gives an overview of its architecture and some of its features. Furthermore, BibSonomy is used as foundation for evaluating and integrating some of the discussed approaches. Collaborative tagging systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In this thesis we evaluate and compare several recommendation algorithms on large-scale real-world datasets: an adaptation of user-based Collaborative Filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag co-occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag co-occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We demonstrate how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender. Furthermore, we show how to integrate recommendation methods into a real tagging system, record and evaluate their performance by describing the tag recommendation framework we developed for 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. We also present an evaluation of the framework which demonstrates its power. The folksonomy graph shows specific structural properties that explain its growth and the possibility of serendipitous exploration. Clicklogs of web search engines 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 folksonomy snapshot and on query logs of two large search engines. We find that all of the three datasets exhibit similar structural properties and thus conclude that the clicking behaviour of search engine users based on the displayed search results and the tagging behaviour of collaborative tagging users is driven by similar dynamics. In this thesis we further transfer the folksonomy paradigm to the Social Semantic Desktop – a new model of computer desktop that uses Semantic Web technologies to better link information items. There we apply community support methods to the folksonomy found in the network of social semantic desktops. Thus, we connect knowledge discovery for folksonomies with semantic technologies. Alltogether, the research in this thesis is centered around collaborative tagging systems and their underlying datastructure – folksonomies – and thereby paves the way for the further dissemination of this successful knowledge management paradigm. }, address = {Heidelberg, Germany}, author = {Jäschke, Robert}, interhash = {dcb2cd1cd72ae45d77c4d8755d199405}, intrahash = {9db90c2ff04f514ada9f6b50fde46065}, isbn = {978-3-89838-332-5}, month = jan, publisher = {Akademische Verlagsgesellschaft AKA}, series = {Dissertationen zur Künstlichen Intelligenz}, title = {Formal Concept Analysis and Tag Recommendations in Collaborative Tagging Systems}, url = {http://www.aka-verlag.com/de/detail?ean=978-3-89838-332-5}, vgwort = {413}, volume = 332, year = 2011 } @inproceedings{gemmell2010hybrid, abstract = {Social annotation systems allow users to annotate resources with personalized tags and to navigate large and complex information spaces without the need to rely on predefined hierarchies. These systems help users organize and share their own resources, as well as discover new ones annotated by other users. Tag recommenders in such systems assist users in finding appropriate tags for resources and help consolidate annotations across all users and resources. But the size and complexity of the data, as well as the inherent noise and inconsistencies in the underlying tag vocabularies, have made the design of effective tag recommenders a challenge. Recent efforts have demonstrated the advantages of integrative models that leverage all three dimensions of a social annotation system: users, resources and tags. Among these approaches are recommendation models based on matrix factorization. But, these models tend to lack scalability and often hide the underlying characteristics, or "information channels" of the data that affect recommendation effectiveness. In this paper we propose a weighted hybrid tag recommender that blends multiple recommendation components drawing separately on complementary dimensions, and evaluate it on six large real-world datasets. In addition, we attempt to quantify the strength of the information channels in these datasets and use these results to explain the performance of the hybrid. We find our approach is not only competitive with the state-of-the-art techniques in terms of accuracy, but also has the added benefits of being scalable to large real world applications, extensible to incorporate a wide range of recommendation techniques, easily updateable, and more scrutable than other leading methods.}, acmid = {1871543}, address = {New York, NY, USA}, author = {Gemmell, Jonathan and Schimoler, Thomas and Mobasher, Bamshad and Burke, Robin}, booktitle = {Proceedings of the 19th ACM international conference on Information and knowledge management}, doi = {10.1145/1871437.1871543}, interhash = {e0020596af50b5d01735acd3d76d3fa1}, intrahash = {9836f538c642c9cff810edba87993d2c}, isbn = {978-1-4503-0099-5}, location = {Toronto, ON, Canada}, numpages = {10}, pages = {829--838}, publisher = {ACM}, series = {CIKM '10}, title = {Hybrid tag recommendation for social annotation systems}, url = {http://doi.acm.org/10.1145/1871437.1871543}, year = 2010 } @inproceedings{conf/wsdm/WetzkerZBA10, author = {Wetzker, Robert and Zimmermann, Carsten and Bauckhage, Christian and Albayrak, Sahin}, booktitle = {WSDM}, crossref = {conf/wsdm/2010}, date = {2010-02-18}, editor = {Davison, Brian D. and Suel, Torsten and Craswell, Nick and Liu, Bing}, ee = {http://doi.acm.org/10.1145/1718487.1718497}, interhash = {12e89c88182a393dae8d63287f65540d}, intrahash = {54d5f72f2993a1c60d3070782bac69ac}, isbn = {978-1-60558-889-6}, pages = {71-80}, publisher = {ACM}, title = {I tag, you tag: translating tags for advanced user models.}, url = {http://dblp.uni-trier.de/db/conf/wsdm/wsdm2010.html#WetzkerZBA10}, year = 2010 } @inproceedings{rae2010improving, abstract = {In this paper we address the task of recommending additional tags to partially annotated media objects, in our case images. We propose an extendable framework that can recommend tags using a combination of different personalised and collective contexts. We combine information from four contexts: (1) all the photos in the system, (2) a user's own photos, (3) the photos of a user's social contacts, and (4) the photos posted in the groups of which a user is a member. Variants of methods (1) and (2) have been proposed in previous work, but the use of (3) and (4) is novel.

For each of the contexts we use the same probabilistic model and Borda Count based aggregation approach to generate recommendations from different contexts into a unified ranking of recommended tags. We evaluate our system using a large set of real-world data from Flickr. We show that by using personalised contexts we can significantly improve tag recommendation compared to using collective knowledge alone. We also analyse our experimental results to explore the capabilities of our system with respect to a user's social behaviour.}, address = {Paris, France}, author = {Rae, Adam and Sigurbjörnsson, Börkur and van Zwol, Roelof}, booktitle = {Adaptivity, Personalization and Fusion of Heterogeneous Information}, interhash = {2595ff47e852a64c7f1c88b915c7e9ad}, intrahash = {98034c615577fd3558fd326fbe03f894}, location = {Paris, France}, pages = {92--99}, publisher = {Le Centre De Hautes Etudes Internationales d'Informatique Documentaire}, series = {RIAO '10}, title = {Improving tag recommendation using social networks}, url = {http://portal.acm.org/citation.cfm?id=1937055.1937077}, year = 2010 } @incollection{radelaar2011improving, affiliation = {Erasmus University Rotterdam, PO Box 1738, NL-3000 Rotterdam, The Netherlands}, author = {Radelaar, Joni and Boor, Aart-Jan and Vandic, Damir and van Dam, Jan-Willem and Hogenboom, Frederik and Frasincar, Flavius}, booktitle = {Web Engineering}, editor = {Auer, Sören and Díaz, Oscar and Papadopoulos, George}, interhash = {48fe306f42bc405a5f8ae0f4a8885f3a}, intrahash = {77bc7f7e46481b47c11dd9e53d5741e0}, note = {10.1007/978-3-642-22233-7_19}, pages = {274-288}, publisher = {Springer Berlin / Heidelberg}, series = {Lecture Notes in Computer Science}, title = {Improving the Exploration of Tag Spaces Using Automated Tag Clustering}, url = {http://dx.doi.org/10.1007/978-3-642-22233-7_19}, volume = 6757, year = 2011 } @inproceedings{sarwar2001item, abstract = {Recommender systems apply knowledge discovery techniques to the problem of making personalized recommendations for information, products or services during a live interaction. These systems, especially the k-nearest neighbor collaborative filtering based ones, are achieving widespread success on the Web. The tremendous growth in the amount of available information and the number of visitors to Web sites in recent years poses some key challenges for recommender systems. These are: producing high quality recommendations, performing many recommendations per second for millions of users and items and achieving high coverage in the face of data sparsity. In traditional collaborative filtering systems the amount of work increases with the number of participants in the system. New recommender system technologies are needed that can quickly produce high quality recommendations, even for very large-scale problems. To address these issues we have explored item-based collaborative filtering techniques. Item-based techniques first analyze the user-item matrix to identify relationships between different items, and then use these relationships to indirectly compute recommendations for users. In this paper we analyze different item-based recommendation generation algorithms. We look into different techniques for computing item-item similarities (e.g., item-item correlation vs. cosine similarities between item vectors) and different techniques for obtaining recommendations from them (e.g., weighted sum vs. regression model). Finally, we experimentally evaluate our results and compare them to the basic k-nearest neighbor approach. Our experiments suggest that item-based algorithms provide dramatically better performance than user-based algorithms, while at the same time providing better quality than the best available user-based algorithms.}, address = {New York, NY, USA}, author = {Sarwar, Badrul and Karypis, George and Konstan, Joseph and Riedl, John}, booktitle = {WWW '01: Proceedings of the 10th International Conference on World Wide Web}, doi = {10.1145/371920.372071}, interhash = {043d1aaba0f0b8c01d84edd517abedaf}, intrahash = {a6461157c8102d34b8001c7d33a42684}, isbn = {1-58113-348-0}, location = {Hong Kong}, pages = {285--295}, publisher = {ACM}, title = {Item-based collaborative filtering recommendation algorithms}, url = {http://portal.acm.org/citation.cfm?id=372071}, year = 2001 } @inproceedings{rendle2009learning, abstract = {Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or delicious. In this paper, we propose a method for tag recommendation based on tensor factorization (TF). In contrast to other TF methods like higher order singular value decomposition (HOSVD), our method RTF ('ranking with tensor factorization') directly optimizes the factorization model for the best personalized ranking. RTF handles missing values and learns from pairwise ranking constraints. Our optimization criterion for TF is motivated by a detailed analysis of the problem and of interpretation schemes for the observed data in tagging systems. In all, RTF directly optimizes for the actual problem using a correct interpretation of the data. We provide a gradient descent algorithm to solve our optimization problem. We also provide an improved learning and prediction method with runtime complexity analysis for RTF. The prediction runtime of RTF is independent of the number of observations and only depends on the factorization dimensions. Besides the theoretical analysis, we empirically show that our method outperforms other state-of-the-art tag recommendation methods like FolkRank, PageRank and HOSVD both in quality and prediction runtime.}, address = {New York, NY, USA}, author = {Rendle, Steffen and Balby Marinho, Leandro and Nanopoulos, Alexandros and Schmidt-Thieme, Lars}, booktitle = {KDD '09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining}, doi = {10.1145/1557019.1557100}, interhash = {1cc85ca2ec82db2a3caf40fd1795a58a}, intrahash = {1bd672ffb8d6ba5589bb0c7deca09412}, isbn = {978-1-60558-495-9}, location = {Paris, France}, pages = {727--736}, publisher = {ACM}, title = {Learning optimal ranking with tensor factorization for tag recommendation}, url = {http://portal.acm.org/citation.cfm?doid=1557019.1557100}, year = 2009 } @incollection{kubatz2011localrank, abstract = {On many modern Web platforms users can annotate the available online resources with freely-chosen tags. This Social Tagging data can then be used for information organization or retrieval purposes. Tag recommenders in that context are designed to help the online user in the tagging process and suggest appropriate tags for resources with the purpose to increase the tagging quality. In recent years, different algorithms have been proposed to generate tag recommendations given the ternary relationships between users, resources, and tags. Many of these algorithms however suffer from scalability and performance problems, including the popular }, author = {Kubatz, Marius and Gedikli, Fatih and Jannach, Dietmar}, booktitle = {E-Commerce and Web Technologies}, doi = {10.1007/978-3-642-23014-1_22}, editor = {Huemer, Christian and Setzer, Thomas}, interhash = {19a8194d47a5f6722a563a3689606440}, intrahash = {f62135043913269240b8e7105c418214}, isbn = {978-3-642-23013-4}, pages = {258-269}, publisher = {Springer Berlin Heidelberg}, series = {Lecture Notes in Business Information Processing}, title = {LocalRank - Neighborhood-Based, Fast Computation of Tag Recommendations}, url = {http://dx.doi.org/10.1007/978-3-642-23014-1_22}, volume = 85, year = 2011 } @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}, series = {WSDM '10}, title = {Pairwise interaction tensor factorization for personalized tag recommendation}, url = {http://doi.acm.org/10.1145/1718487.1718498}, year = 2010 } @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 } @inproceedings{conf/sigir/GuanBMCW09, author = {Guan, Ziyu and Bu, Jiajun and Mei, Qiaozhu and Chen, Chun and Wang, Can}, booktitle = {SIGIR}, crossref = {conf/sigir/2009}, editor = {Allan, James and Aslam, Javed A. and Sanderson, Mark and Zhai, ChengXiang and Zobel, Justin}, ee = {http://doi.acm.org/10.1145/1571941.1572034}, interhash = {53d2e8bc966048bc01efcc57b2fc8250}, intrahash = {ac9427acf51cbf7cb5a35f66a16a32c0}, isbn = {978-1-60558-483-6}, pages = {540-547}, publisher = {ACM}, title = {Personalized tag recommendation using graph-based ranking on multi-type interrelated objects.}, url = {http://www-personal.umich.edu/~qmei/pub/sigir09-tag.pdf}, year = 2009 } @incollection{m2009nliches, author = {Dittmann, C. and Dittmann, M. and Peters, I. and Weller, K.}, booktitle = {Generation international - die Zukunft von Information, Wissenschaft und Profession. Proceedings der 31. Online-Tagung der Germany.}, date = {(2009)}, editor = {Ockenfeld, M.}, interhash = {8b30444eb1620594515e720f6ea04def}, intrahash = {32b5372ad9fb2c2932224454cd869afa}, note = {Frankfurt am Main: DGI}, pages = {117-128}, publisher = {DGI Frankfurt a. M.}, title = {Persönliches Tag Gardening mit tagCare.}, url = {http://wwwalt.phil-fak.uni-duesseldorf.de/infowiss/content/mitarbeiter/peters.php}, year = 2009 } @inproceedings{cattuto2008semantic, abstract = {Social bookmarking systems allow users to organise collections of resources on the Web in a collaborative fashion. The increasing popularity of these systems as well as first insights into their emergent semantics have made them relevant to disciplines like knowledge extraction and ontology learning. The problem of devising methods to measure the semantic relatedness between tags and characterizing it semantically is still largely open. Here we analyze three measures of tag relatedness: tag co-occurrence, cosine similarity of co-occurrence distributions, and FolkRank, an adaptation of the PageRank algorithm to folksonomies. Each measure is computed on tags from a large-scale dataset crawled from the social bookmarking system del.icio.us. To provide a semantic grounding of our findings, a connection to WordNet (a semantic lexicon for the English language) is established by mapping tags into synonym sets of WordNet, and applying there well-known metrics of semantic similarity. Our results clearly expose different characteristics of the selected measures of relatedness, making them applicable to different subtasks of knowledge extraction such as synonym detection or discovery of concept hierarchies.}, address = {Patras, Greece}, author = {Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and Stumme, Gerd}, booktitle = {Proceedings of the 3rd Workshop on Ontology Learning and Population (OLP3)}, interhash = {cc62b733f6e0402db966d6dbf1b7711f}, intrahash = {3b0aca61b24e4343bd80390614e3066e}, isbn = {978-960-89282-6-8}, month = jul, pages = {39--43}, title = {Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems}, url = {http://olp.dfki.de/olp3/}, year = 2008 } @inproceedings{cattuto2008semantica, abstract = {Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For taskslike synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Eventhough most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptionson the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity interms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures oftag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding isprovided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measuresof semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of theinvestigated similarity measures and indicates which ones are better suited in the context of a given semantic application.}, address = {Heidelberg}, author = {Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and Stumme, Gerd}, booktitle = {The Semantic Web -- ISWC 2008, Proc.Intl. Semantic Web Conference 2008}, doi = {http://dx.doi.org/10.1007/978-3-540-88564-1_39}, editor = {Sheth, Amit P. and Staab, Steffen and Dean, Mike and Paolucci, Massimo and Maynard, Diana and Finin, Timothy W. and Thirunarayan, Krishnaprasad}, file = {cattuto2008semantica.pdf:cattuto2008semantica.pdf:PDF}, groups = {public}, interhash = {b44538648cfd476d6c94e30bc6626c86}, intrahash = {27198c985b3bdb6daab0f7e961b370a9}, pages = {615--631}, publisher = {Springer}, series = {LNAI}, title = {Semantic Grounding of Tag Relatedness in Social Bookmarking Systems}, url = {http://www.kde.cs.uni-kassel.de/pub/pdf/cattuto2008semantica.pdf}, username = {dbenz}, volume = 5318, year = 2008 } @inproceedings{cattuto2008semantic, abstract = {Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Eventhough most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptionson the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity interms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures oftag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding isprovided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measuresof semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of theinvestigated similarity measures and indicates which ones are better suited in the context of a given semantic application.}, author = {Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and Stumme, Gerd}, booktitle = {The Semantic Web - ISWC 2008}, doi = {10.1007/978-3-540-88564-1_39}, interhash = {b44538648cfd476d6c94e30bc6626c86}, intrahash = {4752f261d03cead0c52565148a0ba1c9}, isbn = {978-3-540-88563-4}, pages = {615--631}, publisher = {Springer Berlin / Heidelberg}, series = {Lecture Notes in Computer Science}, title = {Semantic Grounding of Tag Relatedness in Social Bookmarking Systems}, url = {http://www.kde.cs.uni-kassel.de/pub/pdf/cattuto2008semantica.pdf}, volume = 5318, year = 2008 } @inproceedings{cattuto2008semantica, abstract = {Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For taskslike synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Eventhough most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptionson the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity interms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures oftag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding isprovided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measuresof semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of theinvestigated similarity measures and indicates which ones are better suited in the context of a given semantic application.}, address = {Heidelberg}, author = {Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and Stumme, Gerd}, booktitle = {The Semantic Web -- ISWC 2008, Proc.Intl. Semantic Web Conference 2008}, doi = {http://dx.doi.org/10.1007/978-3-540-88564-1_39}, editor = {Sheth, Amit P. and Staab, Steffen and Dean, Mike and Paolucci, Massimo and Maynard, Diana and Finin, Timothy W. and Thirunarayan, Krishnaprasad}, file = {cattuto2008semantica.pdf:cattuto2008semantica.pdf:PDF}, groups = {public}, interhash = {b44538648cfd476d6c94e30bc6626c86}, intrahash = {27198c985b3bdb6daab0f7e961b370a9}, pages = {615--631}, publisher = {Springer}, series = {LNAI}, timestamp = {2009-09-14 19:12:46}, title = {Semantic Grounding of Tag Relatedness in Social Bookmarking Systems}, url = {http://www.kde.cs.uni-kassel.de/pub/pdf/cattuto2008semantica.pdf}, username = {dbenz}, volume = 5318, year = 2008 } @inproceedings{cattuto2008semantic, abstract = {Collaborative tagging systems have nowadays become important data sources for populating semantic web applications. For tasks like synonym detection and discovery of concept hierarchies, many researchers introduced measures of tag similarity. Eventhough most of these measures appear very natural, their design often seems to be rather ad hoc, and the underlying assumptionson the notion of similarity are not made explicit. A more systematic characterization and validation of tag similarity interms of formal representations of knowledge is still lacking. Here we address this issue and analyze several measures oftag similarity: Each measure is computed on data from the social bookmarking system del.icio.us and a semantic grounding isprovided by mapping pairs of similar tags in the folksonomy to pairs of synsets in Wordnet, where we use validated measuresof semantic distance to characterize the semantic relation between the mapped tags. This exposes important features of theinvestigated similarity measures and indicates which ones are better suited in the context of a given semantic application.}, address = {Heidelberg}, author = {Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and Stumme, Gerd}, booktitle = {The Semantic Web -- ISWC 2008, Proc.Intl. Semantic Web Conference 2008}, editor = {Sheth, Amit P. and Staab, Steffen and Dean, Mike and Paolucci, Massimo and Maynard, Diana and Finin, Timothy W. and Thirunarayan, Krishnaprasad}, interhash = {b44538648cfd476d6c94e30bc6626c86}, intrahash = {27198c985b3bdb6daab0f7e961b370a9}, pages = {615--631}, publisher = {Springer}, series = {LNAI}, title = {Semantic Grounding of Tag Relatedness in Social Bookmarking Systems}, url = {http://dx.doi.org/10.1007/978-3-540-88564-1_39}, volume = 5318, year = 2008 } @inproceedings{cao2009social, author = {Cao, Hao and Xie, Maoqiang and Xue, Lian and Liu, Chunhua and Teng, Fei and Huang, Yalou}, crossref = {eisterlehner2009ecmlpkdd}, editor = {Eisterlehner, Folke and Hotho, Andreas and Jäschke, Robert}, interhash = {0fe41be4d701afb127ad60cbda517467}, intrahash = {ca6cf1ef17ca098cdd6015e3ca1e4f7c}, issn = {1613-0073}, month = {September}, pages = {35--48}, series = {CEUR-WS.org}, title = {Social Tag Prediction Base on Supervised Ranking Model}, volume = 497, year = 2009 } @inproceedings{suchanek2008social, abstract = {This paper aims to quantify two common assumptions about social tagging: (1) that tags are "meaningful" and (2) that the tagging process is influenced by tag suggestions. For (1), we analyze the semantic properties of tags and the relationship between the tags and the content of the tagged page. Our analysis is based on a corpus of search keywords, contents, titles, and tags applied to several thousand popular Web pages. Among other results, we find that the more popular tags of a page tend to be the more meaningful ones. For (2), we develop a model of how the influence of tag suggestions can be measured. From a user study with over 4,000 participants, we conclude that roughly one third of the tag applications may be induced by the suggestions. Our results would be of interest for designers of social tagging systems and are a step towards understanding how to best leverage social tags for applications such as search and information extraction.}, acmid = {1458114}, address = {New York, NY, USA}, author = {Suchanek, Fabian M. and Vojnovic, Milan and Gunawardena, Dinan}, booktitle = {Proceeding of the 17th ACM conference on Information and knowledge management}, doi = {10.1145/1458082.1458114}, interhash = {1bca5a66a6a562258e0c0357545fed34}, intrahash = {ff31cf8541004adc7cd712ed715706b3}, isbn = {978-1-59593-991-3}, location = {Napa Valley, California, USA}, numpages = {10}, pages = {223--232}, publisher = {ACM}, series = {CIKM '08}, title = {Social tags: meaning and suggestions}, url = {http://doi.acm.org/10.1145/1458082.1458114}, year = 2008 } @inproceedings{1454017, address = {New York, NY, USA}, author = {Symeonidis, Panagiotis and Nanopoulos, Alexandros and Manolopoulos, Yannis}, booktitle = {RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems}, doi = {http://doi.acm.org/10.1145/1454008.1454017}, interhash = {8ee38f4ffc05845fcb98f121fb265d48}, intrahash = {e93afe409833a632af02290bbe134cba}, isbn = {978-1-60558-093-7}, location = {Lausanne, Switzerland}, pages = {43--50}, publisher = {ACM}, title = {Tag recommendations based on tensor dimensionality reduction}, url = {http://portal.acm.org/citation.cfm?id=1454017}, year = 2008 } @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 } @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.}, 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 = {6190d6064dfdb3b8d71f2898539e993e}, note = {accepted for publication}, pages = {New York, NY, USA}, publisher = {ACM}, title = {Tag Recommendations for SensorFolkSonomies}, year = 2013 } @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.}, 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 = {6190d6064dfdb3b8d71f2898539e993e}, note = {accepted for publication}, pages = {New York, NY, USA}, publisher = {ACM}, title = {Tag Recommendations for SensorFolkSonomies}, year = 2013 } @article{jaeschke2008tag, abstract = {Collaborative tagging systems allow users to assign keywords - so called "tags" - to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare several recommendation algorithms on large-scale real life datasets: an adaptation of user-based collaborative filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We show, how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender. }, address = {Amsterdam}, author = {Jäschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd}, doi = {10.3233/AIC-2008-0438}, editor = {Giunchiglia, Enrico}, interhash = {b2f1aba6829affc85d852ea93a8e39f7}, intrahash = {955bcf14f3272ba6eaf3dadbef6c0b10}, issn = {0921-7126}, journal = {AI Communications}, number = 4, pages = {231-247}, publisher = {IOS Press}, title = {Tag Recommendations in Social Bookmarking Systems}, url = {http://dx.doi.org/10.3233/AIC-2008-0438}, vgwort = {63}, volume = 21, year = 2008 } @article{jaeschke2008tag, abstract = {Collaborative tagging systems allow users to assign keywords - so called "tags" - to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare several recommendation algorithms on large-scale real life datasets: an adaptation of user-based collaborative filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We show, how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender. }, address = {Amsterdam}, author = {Jäschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd}, doi = {10.3233/AIC-2008-0438}, editor = {Giunchiglia, Enrico}, interhash = {b2f1aba6829affc85d852ea93a8e39f7}, intrahash = {955bcf14f3272ba6eaf3dadbef6c0b10}, issn = {0921-7126}, journal = {AI Communications}, month = dec, number = 4, pages = {231--247}, publisher = {IOS Press}, title = {Tag Recommendations in Social Bookmarking Systems}, url = {http://www.kde.cs.uni-kassel.de/pub/pdf/jaeschke2008tag.pdf}, vgwort = {63}, volume = 21, year = 2008 } @article{jaeschke2008tag, abstract = {Collaborative tagging systems allow users to assign keywords - so called "tags" - to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare several recommendation algorithms on large-scale real life datasets: an adaptation of user-based collaborative filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We show, how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender. }, address = {Amsterdam}, author = {Jäschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd}, doi = {10.3233/AIC-2008-0438}, editor = {Giunchiglia, Enrico}, interhash = {b2f1aba6829affc85d852ea93a8e39f7}, intrahash = {955bcf14f3272ba6eaf3dadbef6c0b10}, issn = {0921-7126}, journal = {AI Communications}, number = 4, pages = {231-247}, publisher = {IOS Press}, title = {Tag Recommendations in Social Bookmarking Systems}, url = {http://dx.doi.org/10.3233/AIC-2008-0438}, vgwort = {63}, volume = 21, year = 2008 } @article{jaeschke2008tag, abstract = {Collaborative tagging systems allow users to assign keywords - so called "tags" - to resources. Tags are used for navigation, finding resources and serendipitous browsing and thus provide an immediate benefit for users. These systems usually include tag recommendation mechanisms easing the process of finding good tags for a resource, but also consolidating the tag vocabulary across users. In practice, however, only very basic recommendation strategies are applied. In this paper we evaluate and compare several recommendation algorithms on large-scale real life datasets: an adaptation of user-based collaborative filtering, a graph-based recommender built on top of the FolkRank algorithm, and simple methods based on counting tag occurences. We show that both FolkRank and Collaborative Filtering provide better results than non-personalized baseline methods. Moreover, since methods based on counting tag occurrences are computationally cheap, and thus usually preferable for real time scenarios, we discuss simple approaches for improving the performance of such methods. We show, how a simple recommender based on counting tags from users and resources can perform almost as good as the best recommender. }, address = {Amsterdam}, author = {Jäschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd}, doi = {10.3233/AIC-2008-0438}, editor = {Giunchiglia, Enrico}, interhash = {b2f1aba6829affc85d852ea93a8e39f7}, intrahash = {955bcf14f3272ba6eaf3dadbef6c0b10}, issn = {0921-7126}, journal = {AI Communications}, number = 4, pages = {231-247}, publisher = {IOS Press}, title = {Tag Recommendations in Social Bookmarking Systems}, url = {http://dx.doi.org/10.3233/AIC-2008-0438}, vgwort = {63}, volume = 21, year = 2008 } @inproceedings{lipzcak2009tag, author = {Lipczak, Marek and Hu, Yeming and Kollet, Yael and Milios, Evangelos}, booktitle = {ECML PKDD Discovery Challenge 2009 (DC09)}, crossref = {eisterlehner2009ecmlpkdd}, editor = {Eisterlehner, Folke and Hotho, Andreas and Jäschke, Robert}, interhash = {042a9e208f55e00172e2100dc7f356d5}, intrahash = {dc2bfb649e4b0ffe2da37e9e25e0404e}, issn = {1613-0073}, month = sep, pages = {157--172}, series = {CEUR-WS.org}, title = {Tag Sources for Recommendation in Collaborative Tagging Systems}, url = {http://ceur-ws.org/Vol-497/paper_19.pdf}, volume = 497, year = 2009 } @article{zhang2011tagaware, abstract = {In the past decade, Social Tagging Systems have attracted increasing attention from both physical and computer science communities. Besides the underlying structure and dynamics of tagging systems, many efforts have been addressed to unify tagging information to reveal user behaviors and preferences, extract the latent semantic relations among items, make recommendations, and so on. Specifically, this article summarizes recent progress about tag-aware recommender systems, emphasizing on the contributions from three mainstream perspectives and approaches: network-based methods, tensor-based methods, and the topic-based methods. Finally, we outline some other tag-related studies and future challenges of tag-aware recommendation algorithms.}, affiliation = {Institute of Information Economy, Hangzhou Normal University, Hangzhou, 310036 China}, author = {Zhang, Zi-Ke and Zhou, Tao and Zhang, Yi-Cheng}, doi = {10.1007/s11390-011-0176-1}, interhash = {c1f382191eab1f80aaf8cf425c376600}, intrahash = {67b105a941f0a557c6d457447625cbfb}, issn = {1000-9000}, issue = {5}, journal = {Journal of Computer Science and Technology}, keyword = {Computer Science}, number = 5, pages = {767--777}, publisher = {Springer Boston}, title = {Tag-Aware Recommender Systems: A State-of-the-Art Survey}, url = {http://dx.doi.org/10.1007/s11390-011-0176-1}, volume = 26, year = 2011 } @inproceedings{conf/www/SenVR09, author = {Sen, Shilad and Vig, Jesse and Riedl, John}, booktitle = {WWW}, crossref = {conf/www/2009}, editor = {Quemada, Juan and León, Gonzalo and Maarek, Yoëlle S. and Nejdl, Wolfgang}, ee = {http://doi.acm.org/10.1145/1526709.1526800}, interhash = {4968b29a544394a5f9acd1bb8916e230}, intrahash = {8d38bdb12f6f2f89bd3c34d200e48b72}, isbn = {978-1-60558-487-4}, pages = {671-680}, publisher = {ACM}, title = {Tagommenders: connecting users to items through tags.}, url = {http://dblp.uni-trier.de/db/conf/www/www2009.html#SenVR09}, year = 2009 } @article{montas2011tagranker, abstract = {In a social network, recommenders are highly demanded since they provide user interests in order to construct user profiles. This user profiles might be valuable to be exploited in business management or marketing, for instance. Basically, a tag recommender provides to users a set keywords that describe certain resources. The existing approaches require exploiting content information or they just provide a set of tags without any kind of preference order. This article proposes TagRanker, a tag recommender based on logistic regression that is free of exploiting content information. In addition, it gives a ranking of certain tags and learns just from the relations among users, resources and tags previously posted avoiding the cost of exploiting the content of the resources. An adequate evaluation measure for this specific kind of ranking is also proposed, since the existing ones just consider the tags as coming from a classification. The experiments on several data sets show that TagRanker can effectively recommend relevant tags outperforming the performance of a benchmark of Tag Recommender Systems.}, author = {Montañés, Elena and Ramón Quevedo, José and Díaz, Irene and Cortina, Raquel and Alonso, Pedro and Ranilla, José}, doi = {10.1093/jigpal/jzq036}, eprint = {http://jigpal.oxfordjournals.org/content/19/2/395.full.pdf+html}, interhash = {132fda1e475b28c81e5f78373fec36a9}, intrahash = {1fa5025795ddc2e7cb58433ae40c8c05}, journal = {Logic Journal of IGPL}, number = 2, pages = {395-404}, title = {TagRanker: learning to recommend ranked tags}, url = {http://jigpal.oxfordjournals.org/content/19/2/395.abstract}, volume = 19, year = 2011 } @inproceedings{krestel2008art, abstract = {

Collaborative tagging, supported by many social networking websites, is currently enjoying an increasing popularity. The usefulness of this largely available tag data has been explored in many applications including web resources categorization,deriving emergent semantics, web search etc. However, since tags are supplied by users <em>freely</em> , not all of them are useful and reliable, especially when they are generated by spammers with malicious intent. Therefore, identifying tags of high quality is crucial in improving the performance of applications based on tags. In this paper, we propose TRP-Rank (Tag-Resource Pair Rank), an algorithm to measure the quality of tags by manually assessing a seed set and <em>propagating the quality</em> through a graph. The three dimensional relationship among users, tags and web resources is firstly represented by a graph structure. A set of seed nodes, where each node represents a tag annotating a resource, is then selected and their quality is assessed. The quality of the remaining nodes is calculated by propagating the known quality of the seeds through the graph structure. We evaluate our approach on a public data set where tags generated by suspicious spammers were manually labelled. The experimental results demonstrate the effectiveness of this approach in measuring the quality of tags.

}, acmid = {1484165}, address = {Berlin, Heidelberg}, author = {Krestel, Ralf and Chen, Ling}, booktitle = {Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web}, doi = {10.1007/978-3-540-89704-0_18}, interhash = {44401088956f59c92c11f6a910ed4df4}, intrahash = {dc00da9179d556ce047c1b41eb815e21}, isbn = {978-3-540-89703-3}, location = {Bangkok, Thailand}, numpages = {15}, pages = {257--271}, publisher = {Springer-Verlag}, series = {ASWC '08}, title = {The Art of Tagging: Measuring the Quality of Tags}, url = {http://dx.doi.org/10.1007/978-3-540-89704-0_18}, year = 2008 } @article{sinclair2008folksonomy, abstract = { The weighted list, known popularly as a `tag cloud', has appeared on many popular folksonomy-based web-sites. Flickr, Delicious, Technorati and many others have all featured a tag cloud at some point in their history. However, it is unclear whether the tag cloud is actually useful as an aid to finding information. We conducted an experiment, giving participants the option of using a tag cloud or a traditional search interface to answer various questions. We found that where the information-seeking task required specific information, participants preferred the search interface. Conversely, where the information-seeking task was more general, participants preferred the tag cloud. While the tag cloud is not without value, it is not sufficient as the sole means of navigation for a folksonomy-based dataset. }, author = {Sinclair, James and Cardew-Hall, Michael}, doi = {10.1177/0165551506078083}, eprint = {http://jis.sagepub.com/content/34/1/15.full.pdf+html}, interhash = {9781d30a620fe81d1b6b6b06925393ab}, intrahash = {1cc0b296c0af7c80feea7b3bb1bf825c}, journal = {Journal of Information Science}, number = 1, pages = {15-29}, title = {The folksonomy tag cloud: when is it useful?}, url = {http://jis.sagepub.com/content/34/1/15.abstract}, volume = 34, year = 2008 } @article{JamesSinclair02012008, abstract = {The weighted list, known popularly as a `tag cloud', has appeared on many popular folksonomy-based web-sites. Flickr, Delicious, Technorati and many others have all featured a tag cloud at some point in their history. However, it is unclear whether the tag cloud is actually useful as an aid to finding information. We conducted an experiment, giving participants the option of using a tag cloud or a traditional search interface to answer various questions. We found that where the information-seeking task required specific information, participants preferred the search interface. Conversely, where the information-seeking task was more general, participants preferred the tag cloud. While the tag cloud is not without value, it is not sufficient as the sole means of navigation for a folksonomy-based dataset. }, author = {Sinclair, James and Cardew-Hall, Michael}, doi = {10.1177/0165551506078083}, eprint = {http://jis.sagepub.com/cgi/reprint/34/1/15.pdf}, interhash = {9781d30a620fe81d1b6b6b06925393ab}, intrahash = {1cc0b296c0af7c80feea7b3bb1bf825c}, journal = {Journal of Information Science}, number = 1, pages = {15-29}, title = {{The folksonomy tag cloud: when is it useful?}}, url = {http://jis.sagepub.com/cgi/content/abstract/34/1/15}, volume = 34, year = 2008 } @inproceedings{bollen2009suggestions, abstract = {Most tagging systems support the user in the tag selection process by providing tag suggestions, or recommendations, based on a popularity measurement of tags other users provided when tagging the same resource. The majority of theories and mathematical models of tagging found in the literature assume that the emergence of power laws in tagging systems is mainly driven by the imitation behavior of users when observing tag suggestions provided by the user interface of the tagging system. We present experimental results that show that the power law distribution forms regardless of whether or not tag suggestions are presented to the users.}, address = {New York, NY, USA}, author = {Bollen, Dirk and Halpin, Harry}, booktitle = {HT '09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia}, interhash = {280a97ee745f4e0409cf031a1b7ea247}, intrahash = {d7b14a0eb7fabb3cee8846802de069fe}, month = {July}, paperid = {pp161}, publisher = {ACM}, session = {Poster}, title = {The Role of Tag Suggestions in Folksonomies}, year = 2009 } @inproceedings{Kim2008, address = {Berlin, Deutschland}, author = {Kim, Hak Lae and Scerri, Simon and Breslin, John G. and Decker, Stefan and Kim, Hong Gee}, booktitle = {{Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications}}, interhash = {9c5f5af6f47a1a563dbb405c5a58a3cc}, intrahash = {7d3c3c2189394a8686ca9812d58bfe74}, pages = {128--137}, publisher = {{Dublin Core Metadata Initiative}}, title = {{The State of the Art in Tag Ontologies: A Semantic Model for Tagging and Folksonomies}}, year = 2008 } @inproceedings{yeung2007, author = {man Au Yeung, Ching and Gibbins, Nicholas and Shadbolt, Nigel}, bibsource = {DBLP, http://dblp.uni-trier.de}, booktitle = {ESOE}, crossref = {DBLP:conf/semweb/2007esoe}, editor = {Chen, Liming and Cudr{\'e}-Mauroux, Philippe and Haase, Peter and Hotho, Andreas and Ong, Ernie}, ee = {http://ceur-ws.org/Vol-292/paper11.pdf}, interhash = {8d1bea2571673b0b9cdb818043a3a7db}, intrahash = {38a0e7a07d8bd94b8ca7cc3cfd189b7e}, pages = {108-121}, publisher = {CEUR-WS.org}, series = {CEUR Workshop Proceedings}, title = {Understanding the Semantics of Ambiguous Tags in Folksonomies}, volume = 292, year = 2007 } @inproceedings{lorince2014supertagger, author = {Lorince, Jared and Zorowitz, Sam and Murdock, Jaimie and Todd, Peter}, interhash = {4af29810e9c882dc18f560527c65de2f}, intrahash = {014abc7dc30e38859c5e8605dce1a8f6}, title = {“Supertagger” Behavior in Building Folksonomies}, year = 2014 }