@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
}
@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
}
@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{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{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{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{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{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
}
@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
}
@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{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
}
@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{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
}
@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{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
}
@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
}