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.

@inproceedings{doerfel2013analysis, author = {Doerfel, Stephan and Jäschke, Robert}, title = {An analysis of tag-recommender evaluation procedures}, booktitle = {Proceedings of the 7th ACM conference on Recommender systems}, series = {RecSys '13}, publisher = {ACM}, address = {New York, NY, USA}, year = {2013}, pages = {343--346}, url = {https://www.kde.cs.uni-kassel.de/pub/pdf/doerfel2013analysis.pdf}, doi = {10.1145/2507157.2507222}, isbn = {978-1-4503-2409-0}, keywords = {2013, bibsonomy, bookmarking, collaborative, core, evaluation, folkrank, folksonomy, graph, iteg, itegpub, l3s, recommender, social, tagging}, 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.} }

%0 = inproceedings %A = Doerfel, Stephan and Jäschke, Robert %B = Proceedings of the 7th ACM conference on Recommender systems %C = New York, NY, USA %D = 2013 %I = ACM %T = An analysis of tag-recommender evaluation procedures %U = https://www.kde.cs.uni-kassel.de/pub/pdf/doerfel2013analysis.pdf

The information contained in social tagging systems is often modelled as a graph of connections between users, items and tags. Recommendation algorithms such as FolkRank, have the potential to leverage complex relationships in the data, corresponding to multiple hops in the graph. We present an in-depth analysis and evaluation of graph models for social tagging data and propose novel adaptations and extensions of FolkRank to improve tag recommendations. We highlight implicit assumptions made by the widely used folksonomy model, and propose an alternative and more accurate graph-representation of the data. Our extensions of FolkRank address the new item problem by incorporating content data into the algorithm, and significantly improve prediction results on unpruned datasets. Our adaptations address issues in the iterative weight spreading calculation that potentially hinder FolkRank's ability to leverage the deep graph as an information source. Moreover, we evaluate the benefit of considering each deeper level of the graph, and present important insights regarding the characteristics of social tagging data in general. Our results suggest that the base assumption made by conventional weight propagation methods, that closeness in the graph always implies a positive relationship, does not hold for the social tagging domain.

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

%0 = article %A = Landia, Nikolas and Doerfel, Stephan and Jäschke, Robert and Anand, Sarabjot Singh and Hotho, Andreas and Griffiths, Nathan %D = 2013 %T = Deeper Into the Folksonomy Graph: FolkRank Adaptations and Extensions for Improved Tag Recommendations %U = http://arxiv.org/abs/1310.1498

With the rising popularity of smart mobile devices, sensor data-based
pplications have become more and more popular. Their users record
ata during their daily routine or specifically for certain events.
he application WideNoise Plus allows users to record sound samples
nd to annotate them with perceptions and tags. The app is being
sed to document and map the soundscape all over the world. The procedure
f recording, including the assignment of tags, has to be as easy-to-use
s possible. We therefore discuss the application of tag recommender
lgorithms in this particular scenario. We show, that this task is
undamentally different from the well-known tag recommendation problem
n folksonomies as users do no longer tag fix resources but rather
ensory data and impressions. The scenario requires efficient recommender
lgorithms that are able to run on the mobile device, since Internet
onnectivity cannot be assumed to be available. Therefore, we evaluate
he performance of several tag recommendation algorithms and discuss
heir applicability in the mobile sensing use-case.

@inproceedings{mueller2013recommendations, author = {Mueller, Juergen and Doerfel, Stephan and Becker, Martin and Hotho, Andreas and Stumme, Gerd}, title = {Tag Recommendations for SensorFolkSonomies}, 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}, publisher = {ACM}, year = {2013}, pages = {New York, NY, USA}, note = {accepted for publication}, keywords = {2013, RecSys, everyaware, folksonomy, iteg, itegpub, l3s, myown, recommendation, rsweb, sensor, sitc, tag, widenoise}, abstract = {With the rising popularity of smart mobile devices, sensor data-based
pplications have become more and more popular. Their users record
ata during their daily routine or specifically for certain events.
he application WideNoise Plus allows users to record sound samples
nd to annotate them with perceptions and tags. The app is being
sed to document and map the soundscape all over the world. The procedure
f recording, including the assignment of tags, has to be as easy-to-use
s possible. We therefore discuss the application of tag recommender
lgorithms in this particular scenario. We show, that this task is
undamentally different from the well-known tag recommendation problem
n folksonomies as users do no longer tag fix resources but rather
ensory data and impressions. The scenario requires efficient recommender
lgorithms that are able to run on the mobile device, since Internet
onnectivity cannot be assumed to be available. Therefore, we evaluate
he performance of several tag recommendation algorithms and discuss
heir applicability in the mobile sensing use-case.} }

%0 = inproceedings %A = Mueller, Juergen and Doerfel, Stephan and Becker, Martin and Hotho, Andreas and Stumme, Gerd %B = Recommender Systems and the Social Web Workshop at 7th ACM Conference on Recommender Systems, RecSys 2013, Hong Kong, China -- October 12-16, 2013. Proceedings %D = 2013 %I = ACM %T = Tag Recommendations for SensorFolkSonomies

Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the “noise” that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.

@book{balbymarinho2012recommender, author = {Balby Marinho, L. and Hotho, A. and Jäschke, R. and Nanopoulos, A. and Rendle, S. and Schmidt-Thieme, L. and Stumme, G. and Symeonidis, P.}, title = {Recommender Systems for Social Tagging Systems}, series = {SpringerBriefs in Electrical and Computer Engineering}, publisher = {Springer}, year = {2012}, url = {http://link.springer.com/book/10.1007/978-1-4614-1894-8}, doi = {10.1007/978-1-4614-1894-8}, isbn = {978-1-4614-1893-1}, keywords = {2012, bookmarking, collaborative, folksonomy, info20, itegpub, l3s, myown, recommender, social, tagging, tagging,2012}, abstract = {Social Tagging Systems are web applications in which users upload resources (e.g., bookmarks, videos, photos, etc.) and annotate it with a list of freely chosen keywords called tags. This is a grassroots approach to organize a site and help users to find the resources they are interested in. Social tagging systems are open and inherently social; features that have been proven to encourage participation. However, with the large popularity of these systems and the increasing amount of user-contributed content, information overload rapidly becomes an issue. Recommender Systems are well known applications for increasing the level of relevant content over the “noise” that continuously grows as more and more content becomes available online. In social tagging systems, however, we face new challenges. While in classic recommender systems the mode of recommendation is basically the resource, in social tagging systems there are three possible modes of recommendation: users, resources, or tags. Therefore suitable methods that properly exploit the different dimensions of social tagging systems data are needed. In this book, we survey the most recent and state-of-the-art work about a whole new generation of recommender systems built to serve social tagging systems. The book is divided into self-contained chapters covering the background material on social tagging systems and recommender systems to the more advanced techniques like the ones based on tensor factorization and graph-based models.} }

%0 = book %A = Balby Marinho, L. and Hotho, A. and Jäschke, R. and Nanopoulos, A. and Rendle, S. and Schmidt-Thieme, L. and Stumme, G. and Symeonidis, P. %D = 2012 %I = Springer %T = Recommender Systems for Social Tagging Systems %U = http://link.springer.com/book/10.1007/978-1-4614-1894-8

Originally introduced by social bookmarking systems, collaborative tagging, or social tagging, has been widely adopted by many web-based systems like wikis, e-commerce platforms, or social networks. Collaborative tagging systems allow users to annotate resources using freely chosen keywords, so called tags . Those tags help users in finding/retrieving resources, discovering new resources, and navigating through the system. The process of tagging resources is laborious. Therefore, most systems support their users by tag recommender components that recommend tags in a personalized way. The Discovery Challenges 2008 and 2009 of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) tackled the problem of tag recommendations in collaborative tagging systems. Researchers were invited to test their methods in a competition on datasets from the social bookmark and publication sharing system BibSonomy. Moreover, the 2009 challenge included an online task where the recommender systems were integrated into BibSonomy and provided recommendations in real time. In this chapter we review, evaluate and summarize the submissions to the two Discovery Challenges and thus lay the groundwork for continuing research in this area.

@incollection{jaeschke2012challenges, author = {Jäschke, Robert and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd}, title = {Challenges in Tag Recommendations for Collaborative Tagging Systems}, editor = {Pazos Arias, José J. and Fernández Vilas, Ana and Díaz Redondo, Rebeca P.}, booktitle = {Recommender Systems for the Social Web}, series = {Intelligent Systems Reference Library}, publisher = {Springer}, address = {Berlin/Heidelberg}, year = {2012}, volume = {32}, pages = {65--87}, url = {http://dx.doi.org/10.1007/978-3-642-25694-3_3}, doi = {10.1007/978-3-642-25694-3_3}, isbn = {978-3-642-25694-3}, keywords = {2012, bookmarking, challenge, collaborative, dc09, discovery, folksonomy, info20, itegpub, l3s, myown, recommender, rsdc08, social, tagging}, abstract = {Originally introduced by social bookmarking systems, collaborative tagging, or social tagging, has been widely adopted by many web-based systems like wikis, e-commerce platforms, or social networks. Collaborative tagging systems allow users to annotate resources using freely chosen keywords, so called tags . Those tags help users in finding/retrieving resources, discovering new resources, and navigating through the system. The process of tagging resources is laborious. Therefore, most systems support their users by tag recommender components that recommend tags in a personalized way. The Discovery Challenges 2008 and 2009 of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD) tackled the problem of tag recommendations in collaborative tagging systems. Researchers were invited to test their methods in a competition on datasets from the social bookmark and publication sharing system BibSonomy. Moreover, the 2009 challenge included an online task where the recommender systems were integrated into BibSonomy and provided recommendations in real time. In this chapter we review, evaluate and summarize the submissions to the two Discovery Challenges and thus lay the groundwork for continuing research in this area.} }

%0 = incollection %A = Jäschke, Robert and Hotho, Andreas and Mitzlaff, Folke and Stumme, Gerd %B = Recommender Systems for the Social Web %C = Berlin/Heidelberg %D = 2012 %I = Springer %T = Challenges in Tag Recommendations for Collaborative Tagging Systems %U = http://dx.doi.org/10.1007/978-3-642-25694-3_3

Recommendation algorithms and multi-class classifiers can support
ers of social bookmarking systems in assigning tags to their
okmarks. Content based recommenders are the usual approach for
cing the cold start problem, i.e., when a bookmark is uploaded for
e first time and no information from other users can be exploited.
this paper, we evaluate several recommendation algorithms in a
ld-start scenario on a large real-world dataset.

@inproceedings{illig2009comparison, author = {Illig, Jens and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd}, title = {A Comparison of Content-Based Tag Recommendations in Folksonomy Systems}, editor = {Wolff, Karl Erich and Palchunov, Dmitry E. and Zagoruiko, Nikolay G. and Andelfinger, Urs}, booktitle = {Knowledge Processing and Data Analysis}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, address = {Berlin/Heidelberg}, year = {2011}, volume = {6581}, pages = {136--149}, url = {http://dx.doi.org/10.1007/978-3-642-22140-8_9}, doi = {10.1007/978-3-642-22140-8_9}, isbn = {978-3-642-22139-2}, keywords = {2011, content, folksonomy, info20, itegpub, l3s, myown, recommendations, recommender, tag, tagorapub}, abstract = {Recommendation algorithms and multi-class classifiers can support
ers of social bookmarking systems in assigning tags to their
okmarks. Content based recommenders are the usual approach for
cing the cold start problem, i.e., when a bookmark is uploaded for
e first time and no information from other users can be exploited.
this paper, we evaluate several recommendation algorithms in a
ld-start scenario on a large real-world dataset.
} }

%0 = inproceedings %A = Illig, Jens and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd %B = Knowledge Processing and Data Analysis %C = Berlin/Heidelberg %D = 2011 %I = Springer %T = A Comparison of Content-Based Tag Recommendations in Folksonomy Systems %U = http://dx.doi.org/10.1007/978-3-642-22140-8_9

Query logs provide a valuable resource for preference information in search. A user clicking on a specific resource after submitting a query indicates that the resource has some relevance with respect to the query. To leverage the information ofquery logs, one can relate submitted queries from specific users to their clicked resources and build a tripartite graph ofusers, resources and queries. This graph resembles the folksonomy structure of social bookmarking systems, where users addtags to resources. In this article, we summarize our work on building folksonomies from query log files. The focus is on threecomparative studies of the system’s content, structure and semantics. Our results show that query logs incorporate typicalfolksonomy properties and that approaches to leverage the inherent semantics of folksonomies can be applied to query logsas well.

@article{benz2010query, author = {Benz, Dominik and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Stumme, Gerd}, title = {Query Logs as Folksonomies}, journal = {Datenbank-Spektrum}, year = {2010}, volume = {10}, number = {1}, pages = {15--24}, url = {http://dx.doi.org/10.1007/s13222-010-0004-8}, keywords = {2010, folksonomies, folksonomy, info20, itegpub, l3s, log, logs, logsonomy, myown}, abstract = {Query logs provide a valuable resource for preference information in search. A user clicking on a specific resource after submitting a query indicates that the resource has some relevance with respect to the query. To leverage the information ofquery logs, one can relate submitted queries from specific users to their clicked resources and build a tripartite graph ofusers, resources and queries. This graph resembles the folksonomy structure of social bookmarking systems, where users addtags to resources. In this article, we summarize our work on building folksonomies from query log files. The focus is on threecomparative studies of the system’s content, structure and semantics. Our results show that query logs incorporate typicalfolksonomy properties and that approaches to leverage the inherent semantics of folksonomies can be applied to query logsas well. } }

%0 = article %A = Benz, Dominik and Hotho, Andreas and Jäschke, Robert and Krause, Beate and Stumme, Gerd %D = 2010 %T = Query Logs as Folksonomies %U = http://dx.doi.org/10.1007/s13222-010-0004-8

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.

@inproceedings{cattuto08-semantic, author = {Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and Stumme, Gerd}, title = {Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems}, booktitle = {Proceedings of the 3rd Workshop on Ontology Learning and Population (OLP3)}, address = {Patras, Greece}, year = {2008}, url = {http://olp.dfki.de/olp3/}, keywords = {2.0, 2008, collaborative, folksonomies, folksonomy, itegpub, myown, semantic, systems, tagging, web, web2.0}, 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.} }

%0 = inproceedings %A = Cattuto, Ciro and Benz, Dominik and Hotho, Andreas and Stumme, Gerd %B = Proceedings of the 3rd Workshop on Ontology Learning and Population (OLP3) %C = Patras, Greece %D = 2008 %T = Semantic Analysis of Tag Similarity Measures in Collaborative Tagging Systems %U = http://olp.dfki.de/olp3/

Social bookmarking systems allow users to store links to internet resources on a web page. As social bookmarking systems are growing in popularity, search algorithms have been developed that transfer the idea of link-based rankings in the Web to a social bookmarking system’s
ta structure. These rankings differ from traditional search engine rankings in that they incorporate the rating of users.

n this study, we compare search in social bookmarking systems with traditionalWeb search. In the first part, we compare the user activity and behaviour in both kinds of systems, as well as the overlap of the underlying sets of URLs. In the second part,we compare graph-based and vector space rankings for social bookmarking systems with commercial search engine rankings.

ur experiments are performed on data of the social bookmarking system Del.icio.us and on rankings and log data from Google, MSN, and AOL. We will show that part of the difference between the systems is due to different behaviour (e. g., the concatenation of multi-word lexems
single terms in Del.icio.us), and that real-world events may trigger similar behaviour in both kinds of systems. We will also show that a graph-based ranking approach on folksonomies yields results that are closer to the rankings of the commercial search engines than vector space
trieval, and that the correlation is high in particular for the domains that are well covered by the social bookmarking system.

@inproceedings{krause2008comparison, author = {Krause, Beate and Hotho, Andreas and Stumme, Gerd}, title = {A Comparison of Social Bookmarking with Traditional Search}, editor = {Macdonald, Craig and Ounis, Iadh and Plachouras, Vassilis and Ruthven, Ian and White, Ryen W.}, booktitle = {Advances in Information Retrieval, 30th European Conference on IR Research, ECIR 2008}, series = {LNAI}, publisher = {Springer}, address = {Heidelberg}, year = {2008}, volume = {4956}, pages = {101-113}, keywords = {2008, bookmarking, comparison, folksonomies, folksonomy, itegpub, logsonomies, myown, search, social, tagorapub}, abstract = {Social bookmarking systems allow users to store links to internet resources on a web page. As social bookmarking systems are growing in popularity, search algorithms have been developed that transfer the idea of link-based rankings in the Web to a social bookmarking system’s
ta structure. These rankings differ from traditional search engine rankings in that they incorporate the rating of users.

n this study, we compare search in social bookmarking systems with traditionalWeb search. In the first part, we compare the user activity and behaviour in both kinds of systems, as well as the overlap of the underlying sets of URLs. In the second part,we compare graph-based and vector space rankings for social bookmarking systems with commercial search engine rankings.

ur experiments are performed on data of the social bookmarking system Del.icio.us and on rankings and log data from Google, MSN, and AOL. We will show that part of the difference between the systems is due to different behaviour (e. g., the concatenation of multi-word lexems
single terms in Del.icio.us), and that real-world events may trigger similar behaviour in both kinds of systems. We will also show that a graph-based ranking approach on folksonomies yields results that are closer to the rankings of the commercial search engines than vector space
trieval, and that the correlation is high in particular for the domains that are well covered by the social bookmarking system.} }

%0 = inproceedings %A = Krause, Beate and Hotho, Andreas and Stumme, Gerd %B = Advances in Information Retrieval, 30th European Conference on IR Research, ECIR 2008 %C = Heidelberg %D = 2008 %I = Springer %T = A Comparison of Social Bookmarking with Traditional Search

Social bookmarking systems constitute an established
rt of the Web 2.0. In such systems
ers describe bookmarks by keywords
lled tags. The structure behind these social
stems, called folksonomies, can be viewed
a tripartite hypergraph of user, tag and resource
des. This underlying network shows
ecific structural properties that explain its
owth and the possibility of serendipitous
ploration.
day’s search engines represent the gateway
retrieve information from the World Wide
b. Short queries typically consisting of
o to three words describe a user’s information
ed. In response to the displayed
sults of the search engine, users click on
e links of the result page as they expect
e answer to be of relevance.
is clickdata can be represented as a folksonomy
which queries are descriptions of
icked URLs. The resulting network structure,
ich we will term logsonomy is very
milar to the one of folksonomies. In order
find out about its properties, we analyze
e topological characteristics of the tripartite
pergraph of queries, users and bookmarks
a large snapshot of del.icio.us and
query logs of two large search engines.
l of the three datasets show small world
operties. The tagging behavior of users,
ich is explained by preferential attachment
the tags in social bookmark systems, is
flected in the distribution of single query
rds in search engines. We can conclude
at the clicking behaviour of search engine
ers based on the displayed search results
d the tagging behaviour of social bookmarking
ers is driven by similar dynamics.

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

%0 = inproceedings %A = Krause, Beate and Jäschke, Robert and Hotho, Andreas and Stumme, Gerd %B = HT '08: Proceedings of the Nineteenth ACM Conference on Hypertext and Hypermedia %C = New York, NY, USA %D = 2008 %I = ACM %T = Logsonomy - Social Information Retrieval with Logdata %U = http://portal.acm.org/citation.cfm?id=1379092.1379123&coll=ACM&dl=ACM&type=series&idx=SERIES399&part=series&WantType=Journals&title=Proceedings%20of%20the%20nineteenth%20ACM%20conference%20on%20Hypertext%20and%20hypermedia

@inproceedings{krause2008antisocial, author = {Krause, Beate and Schmitz, Christoph and Hotho, Andreas and Stumme, Gerd}, title = {The Anti-Social Tagger - Detecting Spam in Social Bookmarking Systems}, booktitle = {Proc. of the Fourth International Workshop on Adversarial Information Retrieval on the Web}, year = {2008}, url = {http://airweb.cse.lehigh.edu/2008/submissions/krause_2008_anti_social_tagger.pdf}, keywords = {2.0, 2008, bookmarking, folksonomies, folksonomy, itegpub, myown, social, spam, systems, tagger, tagorapub, web, web2.0} }

%0 = inproceedings %A = Krause, Beate and Schmitz, Christoph and Hotho, Andreas and Stumme, Gerd %B = Proc. of the Fourth International Workshop on Adversarial Information Retrieval on the Web %D = 2008 %T = The Anti-Social Tagger - Detecting Spam in Social Bookmarking Systems %U = http://airweb.cse.lehigh.edu/2008/submissions/krause_2008_anti_social_tagger.pdf

Currently, social bookmarking systems provide intuitive support for browsing locally their content. A global view is usually presented by the tag cloud of the
stem, 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.

@inproceedings{grahl2007clustering, author = {Grahl, Miranda and Hotho, Andreas and Stumme, Gerd}, title = {Conceptual Clustering of Social Bookmarking Sites}, booktitle = {7th International Conference on Knowledge Management (I-KNOW '07)}, publisher = {Know-Center}, address = {Graz, Austria}, year = {2007}, pages = {356-364}, keywords = {2007, folksonomies, folksonomy, itegpub, myown, sites, social, tagging, tagorapub}, 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
stem, 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.} }

%0 = inproceedings %A = Grahl, Miranda and Hotho, Andreas and Stumme, Gerd %B = 7th International Conference on Knowledge Management (I-KNOW '07) %C = Graz, Austria %D = 2007 %I = Know-Center %T = Conceptual Clustering of Social Bookmarking Sites

@inproceedings{jaeschke07tagKdml, author = {Jaeschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd}, title = {Tag Recommendations in Folksonomies}, editor = {Hinneburg, Alexander}, booktitle = {Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivität (LWA 2007)}, publisher = {Martin-Luther-Universität Halle-Wittenberg}, year = {2007}, pages = {13-20}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2007/jaeschke07tagrecommendationsKDML.pdf}, isbn = {978-3-86010-907-6}, keywords = {2007, bookmarking, collaborative, filtering, folksonomy, itegpub, l3s, myown, recommender, social} }

%0 = inproceedings %A = Jaeschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd %B = Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivität (LWA 2007) %D = 2007 %I = Martin-Luther-Universität Halle-Wittenberg %T = Tag Recommendations in Folksonomies %U = http://www.kde.cs.uni-kassel.de/stumme/papers/2007/jaeschke07tagrecommendationsKDML.pdf

@inproceedings{schmitz07network, author = {Schmitz, Christoph and Grahl, Miranda and Hotho, Andreas and Stumme, Gerd and Catutto, Ciro and Baldassarri, Andrea and Loreto, Vittorio and Servedio, Vito D. P.}, title = {Network Properties of Folksonomies}, booktitle = {Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization''}, address = {Banff}, year = {2007}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2007/schmitz07network.pdf}, keywords = {2007, emergent, fca, folksonomy, folksononomies, itegpub, l3s, myown, semantics, smallworld, sna, socialnetwork} }

%0 = inproceedings %A = Schmitz, Christoph and Grahl, Miranda and Hotho, Andreas and Stumme, Gerd and Catutto, Ciro and Baldassarri, Andrea and Loreto, Vittorio and Servedio, Vito D. P. %B = Proc. WWW2007 Workshop ``Tagging and Metadata for Social Information Organization'' %C = Banff %D = 2007 %T = Network Properties of Folksonomies %U = http://www.kde.cs.uni-kassel.de/stumme/papers/2007/schmitz07network.pdf

@inproceedings{hjss06bibsonomy, author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd}, title = {BibSonomy: A Social Bookmark and Publication Sharing System}, booktitle = {Proc. of the ICCS 2006 Conceptual Structures Tool Interoperability
Workshop}, year = {2006}, note = {(to appear)}, keywords = {FCA, OntologyHandbook, bibsonomy, bookmarking, folksonomy, iccs, social} }

%0 = inproceedings %A = Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd %B = Proc. of the ICCS 2006 Conceptual Structures Tool Interoperability
Workshop %D = 2006 %T = BibSonomy: A Social Bookmark and Publication Sharing System

Social bookmark tools are rapidly emerging on the Web. In such
stems users are setting up lightweight conceptual structures
lled folksonomies. The reason for their immediate success is the
ct that no specific skills are needed for participating. In this
per we specify a formal model for folksonomies and briefly describe
r own system BibSonomy, which allows for sharing both bookmarks
d publication references in a kind of personal library.

@inproceedings{hotho2006bibsonomy, author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd}, title = {BibSonomy: A Social Bookmark and Publication Sharing System}, editor = {de Moor, Aldo and Polovina, Simon and Delugach, Harry}, booktitle = {Proceedings of the First Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structures}, publisher = {Aalborg Universitetsforlag}, address = {Aalborg}, year = {2006}, pages = {87-102}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006bibsonomy.pdf}, isbn = {87-7307-769-0}, keywords = {2006, FCA, OntologyHandbook, bibsonomy, bookmarking, folksonomy, iccs, l3s, myown, nepomuk, social, tagorapub}, abstract = {Social bookmark tools are rapidly emerging on the Web. In such
stems users are setting up lightweight conceptual structures
lled folksonomies. The reason for their immediate success is the
ct that no specific skills are needed for participating. In this
per we specify a formal model for folksonomies and briefly describe
r own system BibSonomy, which allows for sharing both bookmarks
d publication references in a kind of personal library.} }

%0 = inproceedings %A = Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd %B = Proceedings of the First Conceptual Structures Tool Interoperability Workshop at the 14th International Conference on Conceptual Structures %C = Aalborg %D = 2006 %I = Aalborg Universitetsforlag %T = BibSonomy: A Social Bookmark and Publication Sharing System %U = http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hotho2006bibsonomy.pdf

@inproceedings{hotho2006information, author = {Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd}, title = {Information Retrieval in Folksonomies: Search and Ranking}, booktitle = {Proceedings of the 3rd European Semantic Web Conference}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, year = {2006}, pages = {411-426}, keywords = {FCA, OntologyHandbook, folkrank, folksonomy, graph, information, mining, pagerank, rank, ranking, retrieval, search, seminar2006} }

%0 = inproceedings %A = Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd %B = Proceedings of the 3rd European Semantic Web Conference %D = 2006 %I = Springer %T = Information Retrieval in Folksonomies: Search and Ranking

Social bookmark tools are rapidly emerging on the Web. In such
stems users are setting up lightweight conceptual structures
lled folksonomies. These systems provide currently relatively few
ructure. We discuss in this paper, how association rule mining
n be adopted to analyze and structure folksonomies, and how the results can be used
r ontology learning and supporting emergent semantics. We
monstrate our approach on a large scale dataset stemming from an
line system.

@inproceedings{schmitz2006mining, author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd}, title = {Mining Association Rules in Folksonomies}, editor = {Batagelj, V. and Bock, H.-H. and Ferligoj, A. and Žiberna, A.}, booktitle = {Data Science and Classification. Proceedings of the 10th IFCS Conf.}, series = {Studies in Classification, Data Analysis, and Knowledge Organization}, publisher = {Springer}, address = {Heidelberg}, year = {2006}, pages = {261--270}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006mining.pdf}, keywords = {2006, analysis, fca, folksonomies, folksonomy, l3s, myown, nepomuk, network, semantic}, abstract = {Social bookmark tools are rapidly emerging on the Web. In such
stems users are setting up lightweight conceptual structures
lled folksonomies. These systems provide currently relatively few
ructure. We discuss in this paper, how association rule mining
n be adopted to analyze and structure folksonomies, and how the results can be used
r ontology learning and supporting emergent semantics. We
monstrate our approach on a large scale dataset stemming from an
line system.} }

%0 = inproceedings %A = Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd %B = Data Science and Classification. Proceedings of the 10th IFCS Conf. %C = Heidelberg %D = 2006 %I = Springer %T = Mining Association Rules in Folksonomies %U = http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006mining.pdf

@techreport{GH05structure, author = {Golder, Scott and Huberman, Bernardo A.}, title = {The Structure of Collaborative Tagging Systems}, year = {2005}, url = {http://arxiv.org/abs/cs.DL/0508082}, keywords = {FCA, OntologyHandbook, folksonomy, structure, tagging} }

%0 = techreport %A = Golder, Scott and Huberman, Bernardo A. %B = } %C = %D = 2005 %I = %T = The Structure of Collaborative Tagging Systems} %U = http://arxiv.org/abs/cs.DL/0508082

We describe online collaborative communities by tripartite networks,
the nodes being persons, items and tags. We introduce projection
methods in order to uncover the structures of the networks, i.e.
communities of users, genre families... <br />To do so, we focus
on the correlations between the nodes, depending on their profiles,
and use percolation techniques that consist in removing less correlated
links and observing the shaping of disconnected islands. The structuring
of the network is visualised by using a tree representation. The
notion of diversity in the system is also discussed.

@misc{citeulike:484851, author = {Lambiotte, R. and Ausloos, M.}, title = {Collaborative tagging as a tripartite network}, year = {2005}, note = {ttarXiv:cs.DS/0512090}, url = {http://arxiv.org/abs/cs.DS/0512090}, keywords = {FCA, OntologyHandbook, collaboration, discovery, folksonomy, tagging, taxonomy}, abstract = {We describe online collaborative communities by tripartite networks, the nodes being persons, items and tags. We introduce projection methods in order to uncover the structures of the networks, i.e. communities of users, genre families... <br />To do so, we focus on the correlations between the nodes, depending on their profiles, and use percolation techniques that consist in removing less correlated links and observing the shaping of disconnected islands. The structuring of the network is visualised by using a tree representation. The notion of diversity in the system is also discussed.} }

%0 = misc %A = Lambiotte, R. and Ausloos, M. %B = } %C = %D = 2005 %I = %T = Collaborative tagging as a tripartite network} %U = http://arxiv.org/abs/cs.DS/0512090