Personalized tag recommendation using graph-based ranking on multi-type interrelated objects

  • Authors:
  • Ziyu Guan;Jiajun Bu;Qiaozhu Mei;Chun Chen;Can Wang

  • Affiliations:
  • Zhejiang Key Laboratory of Service Robot, College of Computer Science, Zhejiang University, Hangzhou, China;Zhejiang Key Laboratory of Service Robot, College of Computer Science, Zhejiang University, Hangzhou, China;Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA;Zhejiang Key Laboratory of Service Robot, College of Computer Science, Zhejiang University, Hangzhou, China;Zhejiang Key Laboratory of Service Robot, College of Computer Science, Zhejiang University, Hangzhou, China

  • Venue:
  • Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Social tagging is becoming increasingly popular in many Web 2.0 applications where users can annotate resources (e.g. Web pages) with arbitrary keywords (i.e. tags). A tag recommendation module can assist users in tagging process by suggesting relevant tags to them. It can also be directly used to expand the set of tags annotating a resource. The benefits are twofold: improving user experience and enriching the index of resources. However, the former one is not emphasized in previous studies, though a lot of work has reported that different users may describe the same concept in different ways. We address the problem of personalized tag recommendation for text documents. In particular, we model personalized tag recommendation as a "query and ranking" problem and propose a novel graph-based ranking algorithm for interrelated multi-type objects. When a user issues a tagging request, both the document and the user are treated as a part of the query. Tags are then ranked by our graph-based ranking algorithm which takes into consideration both relevance to the document and preference of the user. Finally, the top ranked tags are presented to the user as suggestions. Experiments on a large-scale tagging data set collected from Del.icio.us have demonstrated that our proposed algorithm significantly outperforms algorithms which fail to consider the diversity of different users' interests.