@article{burke2011recommendation, abstract = {Recommender systems are a means of personalizing the presentation of information to ensure that users see the items most relevant to them. The social web has added new dimensions to the way people interact on the Internet, placing the emphasis on user-generated content. Users in social networks create photos, videos and other artifacts, collaborate with other users, socialize with their friends and share their opinions online. This outpouring of material has brought increased attention to recommender systems, as a means of managing this vast universe of content. At the same time, the diversity and complexity of the data has meant new challenges for researchers in recommendation. This article describes the nature of recommendation research in social web applications and provides some illustrative examples of current research directions and techniques. It is difficult to overstate the impact of the social web. This new breed of social applications is reshaping nearly every human activity from the way people watch movies to how they overthrow governments. Facebook allows its members to maintain friendships whether they live next door or on another continent. With Twitter, users from celebrities to ordinary folks can launch their 140 character messages out to a diverse horde of ‘‘followers.” Flickr and YouTube users upload their personal media to share with the world, while Wikipedia editors collaborate on the world’s largest encyclopedia.}, author = {Burke, Robin and Gemmell, Jonathan and Hotho, Andreas and Jäschke, Robert}, interhash = {3089ca25de28ef0bc80bcdebd375a6f9}, intrahash = {41dbb2c9f71440c9aa402f8966117979}, journal = {AI Magazine}, number = 3, pages = {46--56}, publisher = {Association for the Advancement of Artificial Intelligence}, title = {Recommendation in the Social Web}, url = {http://www.aaai.org/ojs/index.php/aimagazine/article/view/2373}, volume = 32, year = 2011 } @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 } @phdthesis{bogers2009recommender, abstract = {Recommender systems belong to a class of personalized information filtering technologies that aim to identify which items in a collection might be of interest to a particular user. Recommendations can be made using a variety of information sources related to both the user and the items: past user preferences, demographic information, item popularity, the metadata characteristics of the products, etc. Social bookmarking websites, with their emphasis on open collaborative information access, offer an ideal scenario for the application of recommender systems technology. They allow users to manage their favorite bookmarks online through a web interface and, in many cases, allow their users to tag the content they have added to the system with keywords. The underlying application then makes all information sharable among users. Examples of social bookmarking services include Delicious, Diigo, Furl, CiteULike, and BibSonomy. In my Ph.D. thesis I describe the work I have done on item recommendation for social bookmarking, i.e., recommending interesting bookmarks to users based on the content they bookmarked in the past. In my experiments I distinguish between two types of information sources. The first one is usage data contained in the folksonomy, which represents the past selections and transactions of all users, i.e., who added which items, and with what tags. The second information source is the metadata describing the bookmarks or articles on a social bookmarking website, such as title, description, authorship, tags, and temporal and publication-related metadata. I compare and combine the content-based aspect with the more common usage-based approaches. I evaluate my approaches on four data sets constructed from three different social bookmarking websites: BibSonomy, CiteULike, and Delicious. In addition, I investigate different combination methods for combining different algorithms and show which of those methods can successfully improve recommendation performance. Finally, I consider two growing pains that accompany the maturation of social bookmarking websites: spam and duplicate content. I examine how widespread each of these problems are for social bookmarking and how to develop effective automatic methods for detecting such unwanted content. Finally, I investigate the influence spam and duplicate content can have on item recommendation. }, address = {Tilburg, The Netherlands}, author = {Bogers, Toine}, interhash = {65b74dcabaa583a48469f3dec2ec1f62}, intrahash = {b02daac1201473600b7c8d2553865b4a}, month = dec, school = {Tilburg University}, title = {Recommender Systems for Social Bookmarking}, url = {http://ilk.uvt.nl/~toine/phd-thesis/}, year = 2009 } @inproceedings{Cai:2011:LTD:1935826.1935920, abstract = {Social tagging recommendation is an urgent and useful enabling technology for Web 2.0. In this paper, we present a systematic study of low-order tensor decomposition approach that are specifically targeted at the very sparse data problem in tagging recommendation problem. Low-order polynomials have low functional complexity, are uniquely capable of enhancing statistics and also avoids over-fitting than traditional tensor decompositions such as Tucker and Parafac decompositions. We perform extensive experiments on several datasets and compared with 6 existing methods. Experimental results demonstrate that our approach outperforms existing approaches.}, acmid = {1935920}, address = {New York, NY, USA}, author = {Cai, Yuanzhe and Zhang, Miao and Luo, Dijun and Ding, Chris and Chakravarthy, Sharma}, booktitle = {Proceedings of the fourth ACM international conference on Web search and data mining}, doi = {10.1145/1935826.1935920}, interhash = {414f80ad09d994af6f448446c04cd226}, intrahash = {52a9e5fd121bf7be4fa8670cc93a7197}, isbn = {978-1-4503-0493-1}, location = {Hong Kong, China}, numpages = {10}, pages = {695--704}, publisher = {ACM}, series = {WSDM '11}, title = {Low-order tensor decompositions for social tagging recommendation}, url = {http://doi.acm.org/10.1145/1935826.1935920}, year = 2011 } @article{citeulike:8506476, abstract = {{Social tagging systems pose new challenges to developers of recommender systems. As observed by recent research, traditional implementations of classic recommender approaches, such as collaborative filtering, are not working well in this new context. To address these challenges, a number of research groups worldwide work on adapting these approaches to the specific nature of social tagging systems. In joining this stream of research, we have developed and evaluated two enhancements of user-based collaborative filtering algorithms to provide recommendations of articles on Cite ULike, a social tagging service for scientific articles. The result obtained after two phases of evaluation suggests that both enhancements are beneficial. Incorporating the number of raters into the algorithms, as we do in our NwCF approach, leads to an improvement of precision, while tag-based BM25 similarity measure, an alternative to Pearson correlation for calculating the similarity between users and their neighbors, increases the coverage of the recommendation process.}}, address = {Los Alamitos, CA, USA}, author = {Santander, Denis P. and Brusilovsky, Peter}, citeulike-article-id = {8506476}, citeulike-linkout-0 = {http://doi.ieeecomputersociety.org/10.1109/WI-IAT.2010.261}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/WI-IAT.2010.261}, doi = {10.1109/WI-IAT.2010.261}, interhash = {dd320da969151c01cf270976c0803274}, intrahash = {2c8764f2fe11ef1ae43fc0a5b51301ae}, isbn = {978-0-7695-4191-4}, journal = {Web Intelligence and Intelligent Agent Technology, IEEE/WIC/ACM International Conference on}, pages = {136--142}, posted-at = {2011-01-05 00:19:36}, priority = {0}, publisher = {IEEE Computer Society}, title = {{Improving Collaborative Filtering in Social Tagging Systems for the Recommendation of Scientific Articles}}, url = {http://dx.doi.org/10.1109/WI-IAT.2010.261}, volume = 1, year = 2010 } @article{benz2010social, abstract = {Social resource sharing systems are central elements of the Web 2.0 and use the same kind of lightweight knowledge representation, called folksonomy. Their large user communities and ever-growing networks of user-generated content have made them an attractive object of investigation for researchers from different disciplines like Social Network Analysis, Data Mining, Information Retrieval or Knowledge Discovery. In this paper, we summarize and extend our work on different aspects of this branch of Web 2.0 research, demonstrated and evaluated within our own social bookmark and publication sharing system BibSonomy, which is currently among the three most popular systems of its kind. We structure this presentation along the different interaction phases of a user with our system, coupling the relevant research questions of each phase with the corresponding implementation issues. This approach reveals in a systematic fashion important aspects and results of the broad bandwidth of folksonomy research like capturing of emergent semantics, spam detection, ranking algorithms, analogies to search engine log data, personalized tag recommendations and information extraction techniques. We conclude that when integrating a real-life application like BibSonomy into research, certain constraints have to be considered; but in general, the tight interplay between our scientific work and the running system has made BibSonomy a valuable platform for demonstrating and evaluating Web 2.0 research.}, address = {Berlin / Heidelberg}, author = {Benz, Dominik and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Mitzlaff, Folke and Schmitz, Christoph and Stumme, Gerd}, doi = {10.1007/s00778-010-0208-4}, interhash = {57fe43734b18909a24bf5bf6608d2a09}, intrahash = {c9437d5ec56ba949f533aeec00f571e3}, issn = {1066-8888}, journal = {The VLDB Journal}, month = dec, number = 6, pages = {849--875}, publisher = {Springer}, title = {The Social Bookmark and Publication Management System BibSonomy}, url = {http://www.kde.cs.uni-kassel.de/pub/pdf/benz2010social.pdf}, volume = 19, year = 2010 } @article{hotho2010publikationsmanagement, abstract = {Kooperative Verschlagwortungs- bzw. Social-Bookmarking-Systeme wie Delicious, Mister Wong oder auch unser eigenes System BibSonomy erfreuen sich immer gr{\"o}{\ss}erer Beliebtheit und bilden einen zentralen Bestandteil des heutigen Web 2.0. In solchen Systemen erstellen Nutzer leichtgewichtige Begriffssysteme, sogenannte Folksonomies, die die Nutzerdaten strukturieren. Die einfache Bedienbarkeit, die Allgegenw{\"a}rtigkeit, die st{\"a}ndige Verf{\"u}gbarkeit, aber auch die M{\"o}glichkeit, Gleichgesinnte spontan in solchen Systemen zu entdecken oder sie schlicht als Informationsquelle zu nutzen, sind Gr{\"u}nde f{\"u}r ihren gegenw{\"a}rtigen Erfolg. Der Artikel f{\"u}hrt den Begriff Social Bookmarking ein und diskutiert zentrale Elemente (wie Browsing und Suche) am Beispiel von BibSonomy anhand typischer Arbeitsabl{\"a}ufe eines Wissenschaftlers. Wir beschreiben die Architektur von BibSonomy sowie Wege der Integration und Vernetzung von BibSonomy mit Content-Management-Systemen und Webauftritten. Der Artikel schlie{\ss}t mit Querbez{\"u}gen zu aktuellen Forschungsfragen im Bereich Social Bookmarking.}, author = {Hotho, Andreas and Benz, Dominik and Eisterlehner, Folke and J{\"a}schke, Robert and Krause, Beate and Schmitz, Christoph and Stumme, Gerd}, file = {dpunkt Product page:http\://hmd.dpunkt.de/271/05.html:URL}, interhash = {4555775b639fe1ec65a302a61ee6532c}, intrahash = {250d83c41fb10b89c73f54bd7040bd6e}, issn = {1436-3011}, journal = {HMD -- Praxis der Wirtschaftsinformatik}, month = {#feb#}, pages = {47-58}, title = {{Publikationsmanagement mit BibSonomy -- ein Social-Bookmarking-System f{\"u}r Wissenschaftler}}, volume = {Heft 271}, year = 2010 } @inproceedings{Bao_2007, abstract = {This paper explores the use of social annotations to improve web search. Nowadays, many services, e.g. del.icio.us, have been developed for web users to organize and share their favorite web pages on line by using social annotations. We observe that the social annotations can benefit web search in two aspects: 1) the annotations are usually good summaries of corresponding web pages; 2) the count of annotations indicates the popularity of web pages. Two novel algorithms are proposed to incorporate the above information into page ranking: 1) SocialSimRank (SSR) calculates the similarity between social annotations and web queries; 2) SocialPageRank (SPR) captures the popularity of web pages. Preliminary experimental results show that SSR can find the latent semantic association between queries and annotations, while SPR successfully measures the quality (popularity) of a web page from the web users’ perspective. We further evaluate the proposed methods empirically with 50 manually constructed queries and 3000 auto-generated queries on a dataset crawled from del.icio.us. Experiments show that both SSR and SPR benefit web search significantly.}, address = {New York, NY, USA}, author = {Bao, Shenghua and Xue, Guirong and Wu, Xiaoyuan and Yu, Yong and Fei, Ben and Su, Zhong}, booktitle = {WWW '07: Proceedings of the 16th international conference on World Wide Web}, interhash = {2cbdc7da88c90ef22468108c1f481159}, intrahash = {b9966b9df0199a0b7b2d5a1b0d7560cb}, publisher = {ACM Press}, title = {Optimizing web search using social annotations}, year = 2007 } @inproceedings{taggingsem08, abstract = {At present tagging is experimenting a great diffusion as the most adopted way to collaboratively classify resources over the Web. In this paper, after a detailed analysis of the attempts made to improve the organization and structure of tagging systems as well as the usefulness of this kind of social data, we propose and evaluate the Tag Disambiguation Algorithm, mining del.icio.us data. It allows to easily semantify the tags of the users of a tagging service: it automatically finds out for each tag the related concept of Wikipedia in order to describe Web resources through senses. On the basis of a set of evaluation tests, we analyze all the advantages of our sense-based way of tagging, proposing new methods to keep the set of users tags more consistent or to classify the tagged resources on the basis of Wikipedia categories, YAGO classes or Wordnet synsets. We discuss also how our semanitified social tagging data are strongly linked to DBPedia and the datasets of the Linked Data community. }, author = {Tesconi, Maurizio and Ronzano, Francesco and Marchetti, Andrea and Minutoli, Salvatore}, crossref = {CEUR-WS.org/Vol-405}, interhash = {0c1c96b41a0af8512c20a7d41504640f}, intrahash = {348a962fe13e0b605ffc53d592464c24}, title = {Semantify del.icio.us: Automatically Turn your Tags into Senses}, url = {http://CEUR-WS.org/Vol-405/paper8.pdf}, year = 2008 } @article{journals/internet/HeymannKG07, author = {Heymann, Paul and Koutrika, Georgia and Garcia-Molina, Hector}, date = {2007-11-08}, ee = {http://doi.ieeecomputersociety.org/10.1109/MIC.2007.125}, interhash = {dea5faea536678622993617bfc5fbb85}, intrahash = {8a293527604e19085173fa461340f55e}, journal = {IEEE Internet Computing}, number = 6, pages = {36-45}, title = {Fighting Spam on Social Web Sites: A Survey of Approaches and Future Challenges.}, url = {http://dblp.uni-trier.de/db/journals/internet/internet11.html#HeymannKG07}, volume = 11, year = 2007 } @inproceedings{conf/airweb/MarkinesCM09, author = {Markines, Benjamin and Cattuto, Ciro and Menczer, Filippo}, booktitle = {AIRWeb}, crossref = {conf/airweb/2009}, date = {2009-05-06}, editor = {Fetterly, Dennis and Gyöngyi, Zoltán}, ee = {http://doi.acm.org/10.1145/1531914.1531924}, interhash = {50847302da776b6e04e53209a0b54699}, intrahash = {46e6041bcf0ba281cdcc3fc4cec6ae60}, isbn = {978-1-60558-438-6}, pages = {41-48}, series = {ACM International Conference Proceeding Series}, title = {Social spam detection.}, url = {http://dblp.uni-trier.de/db/conf/airweb/airweb2009.html#MarkinesCM09}, year = 2009 } @inproceedings{koutrika2007combating, address = {New York, NY, USA}, author = {Koutrika, Georgia and Effendi, Frans Adjie and Gy\"{o}ngyi, Zolt\'{a}n and Heymann, Paul and Garcia-Molina, Hector}, booktitle = {AIRWeb '07: Proceedings of the 3rd international workshop on Adversarial information retrieval on the web}, doi = {http://doi.acm.org/10.1145/1244408.1244420}, interhash = {8b6de1f035a46f5465f1ed868a18c79a}, intrahash = {776b76b33d469e438b0e5f74fc7ec7f0}, isbn = {978-1-59593-732-2}, location = {Banff, Alberta, Canada}, pages = {57--64}, publisher = {ACM Press}, title = {Combating spam in tagging systems}, url = {http://portal.acm.org/citation.cfm?id=1244408.1244420}, year = 2007 } @inproceedings{www200965, 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--641}, title = {Evaluating Similarity Measures for Emergent Semantics of Social Tagging}, url = {http://www2009.eprints.org/65/}, year = 2009 } @inproceedings{heymann2008social, abstract = {In this paper, we look at the "social tag prediction" problem. Given a set of objects, and a set of tags applied to those objects by users, can we predict whether a given tag could/should be applied to a particular object? We investigated this question using one of the largest crawls of the social bookmarking system del.icio.us gathered to date. For URLs in del.icio.us, we predicted tags based on page text, anchor text, surrounding hosts, and other tags applied to the URL. We found an entropy-based metric which captures the generality of a particular tag and informs an analysis of how well that tag can be predicted. We also found that tag-based association rules can produce very high-precision predictions as well as giving deeper understanding into the relationships between tags. Our results have implications for both the study of tagging systems as potential information retrieval tools, and for the design of such systems.}, address = {New York, NY, USA}, author = {Heymann, Paul and Ramage, Daniel and Garcia-Molina, Hector}, booktitle = {SIGIR '08: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval}, doi = {http://doi.acm.org/10.1145/1390334.1390425}, interhash = {bb9455c80cc9bd8cf95c951a1318dabc}, intrahash = {0e6023e192f539fe4fce9894b1fbca5a}, isbn = {978-1-60558-164-4}, location = {Singapore, Singapore}, pages = {531--538}, publisher = {ACM}, title = {Social tag prediction}, url = {http://portal.acm.org/citation.cfm?id=1390334.1390425}, 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{1458098, address = {New York, NY, USA}, author = {Song, Yang and Zhang, Lu and Giles, C. Lee}, booktitle = {CIKM '08: Proceeding of the 17th ACM conference on Information and knowledge mining}, doi = {http://doi.acm.org/10.1145/1458082.1458098}, interhash = {5c03bc1e658b6d44f053944418bdaec3}, intrahash = {d330a3537b4a14fbd40661424ec8e465}, isbn = {978-1-59593-991-3}, location = {Napa Valley, California, USA}, pages = {93--102}, publisher = {ACM}, title = {A sparse gaussian processes classification framework for fast tag suggestions}, url = {http://portal.acm.org/citation.cfm?id=1458098}, year = 2008 } @inproceedings{1316677, address = {New York, NY, USA}, author = {Farooq, Umer and Kannampallil, Thomas G. and Song, Yang and Ganoe, Craig H. and Carroll, John M. and Giles, Lee}, booktitle = {GROUP '07: Proceedings of the 2007 international ACM conference on Conference on supporting group work}, doi = {http://doi.acm.org/10.1145/1316624.1316677}, interhash = {66928ca91bf0d777b848fe6f7a55de20}, intrahash = {5d0b61727d81aed019ba4297090108ca}, isbn = {978-1-59593-845-9}, location = {Sanibel Island, Florida, USA}, pages = {351--360}, publisher = {ACM}, title = {Evaluating tagging behavior in social bookmarking systems: metrics and design heuristics}, url = {http://portal.acm.org/citation.cfm?id=1316677&coll=Portal&dl=GUIDE&CFID=9767993&CFTOKEN=86305662}, year = 2007 } @inproceedings{Noll/2007/search, abstract = {In this paper, we present a new approach to web search personalization based on user collaboration and sharing of information about web documents. The proposed personalization technique separates data collection and user profiling from the information system whose contents and indexed documents are being searched for, i.e. the search engines, and uses social bookmarking and tagging to re-rank web search results. It is independent of the search engine being used, so users are free to choose the one they prefer, even if their favorite search engine does not natively support personalization. We show how to design and implement such a system in practice and investigate its feasibility and usefulness with large sets of real-word data and a user study.}, address = {Berlin, Heidelberg}, author = {Noll, Michael and Meinel, Christoph}, booktitle = {Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea}, crossref = {http://data.semanticweb.org/conference/iswc-aswc/2007/proceedings}, editor = {Aberer, Karl and Choi, Key-Sun and Noy, Natasha and Allemang, Dean and Lee, Kyung-Il and Nixon, Lyndon J B and Golbeck, Jennifer and Mika, Peter and Maynard, Diana and Schreiber, Guus and Cudré-Mauroux, Philippe}, interhash = {8c1f9db1455effa2cdf949c0191a31d2}, intrahash = {52943a6298169f5a552bffbbee352937}, month = {November}, pages = {365--378}, publisher = {Springer Verlag}, series = {LNCS}, title = {Web search personalization via social bookmarking and tagging}, url = {http://iswc2007.semanticweb.org/papers/365.pdf}, volume = 4825, year = 2007 } @inproceedings{grahl2007clustering, abstract = {Currently, social bookmarking systems provide intuitive support for browsing locally their content. A global view is usually presented by the tag cloud of the system, but it does not allow a conceptual drill-down, e. g., along a conceptual hierarchy. In this paper, we present a clustering approach for computing such a conceptual hierarchy for a given folksonomy. The hierarchy is complemented with ranked lists of users and resources most related to each cluster. The rankings are computed using our FolkRank algorithm. We have evaluated our approach on large scale data from the del.icio.us bookmarking system.}, address = {Graz, Austria}, author = {Grahl, Miranda and Hotho, Andreas and Stumme, Gerd}, booktitle = {7th International Conference on Knowledge Management (I-KNOW '07)}, interhash = {5cf58d2fdd3c17f0b0c54ce098ff5b60}, intrahash = {334d3ab11400c4a3ea3ed5b1e95c1855}, issn = {0948-695x}, month = SEP, pages = {356-364}, publisher = {Know-Center}, title = {Conceptual Clustering of Social Bookmarking Sites}, vgwort = {14}, year = 2007 } @inproceedings{jaschke07recommender, author = {Jäschke, Robert and Marinho, Leandro Balby and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd}, bibsource = {DBLP, http://dblp.uni-trier.de}, booktitle = {Knowledge Discovery in Databases: PKDD 2007, 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings}, editor = {Kok, Joost N. and Koronacki, Jacek and de Mántaras, Ramon López and Matwin, Stan and Mladenic, Dunja and Skowron, Andrzej}, ee = {http://dx.doi.org/10.1007/978-3-540-74976-9_52}, interhash = {7e212e3bac146d406035adebff248371}, intrahash = {b8b87c78e9e27a44aacde0402c642bff}, isbn = {978-3-540-74975-2}, pages = {506-514}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Tag Recommendations in Folksonomies}, url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2007/Tag_Recommender_in_Folksonomies_final.pdf}, vgwort = {20}, volume = 4702, year = 2007 }