Tag recommendations in social bookmarking systems

  • Authors:
  • Robert Jä/schke;Leandro Marinho;Andreas Hotho;Lars Schmidt-Thieme;Gerd Stumme

  • Affiliations:
  • (Correspd. (KDE), Univ. of Kassel, Tel.: +49 561 804 6253/ E-mail: jaeschke@cs.uni-kassel.de) (KDE), Univ. of Kassel, Kassel. URL: http://www.kde.cs.uni-kassel.de and Res. Ctr. L3S, Hannover, Germ ...;(Brazilian National Council Scientific and Technological Research (CNPq) scholarship holder) Info. Sys. and Machine Learning Lab (ISMLL), Univ. of Hildesheim, Hildesheim, Germany. URL: http://www. ...;Knowledge & Data Engineering Group (KDE), University of Kassel, Kassel, Germany. URL: http://www.kde.cs.uni-kassel.de;Information Systems and Machine Learning Lab (ISMLL), University of Hildesheim, Hildesheim, Germany. URL: http://www.ismll.uni-hildesheim.de;Knowledge & Data Engineering Group (KDE), University of Kassel, Kassel, Germany. URL: http://www.kde.cs.uni-kassel.de and Research Center L3S, Hannover, Germany. URL: http://www.l3s.de

  • Venue:
  • AI Communications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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 occurrences. 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.