Friend recommendation by user similarity graph based on interest in social tagging systems

20Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Social tagging system has become a hot research topic due to the prevalence of Web2.0 during the past few years. These systems can provide users effective ways to collaboratively annotate and organize items with their own tags. However, the flexibility of annotation brings with large numbers of redundant tags. It is a very difficult task to find users’ interest exactly and recommend proper friends to users in social tagging systems. In this paper, we propose a Friend Recommendation algorithm by User similarity Graph (FRUG) to find potential friends with the same interest in social tagging systems. To alleviate the problem of tag redundancy, we utilize Latent Dirichlet Allocation (LDA) to obtain users’ interest topics. Moreover, we propose a novel multiview users’ similarity measure method to calculate similarity from users’ interest topics, co-collected items and co-annotated tags. Then, based on the users’ similarities, we build user similarity graph and make interest-based user recommendation by mining the graph. The experimental results on tagging dataset of Delicious validate the good performance of FRUG in terms of precision and recall.

Cite

CITATION STYLE

APA

Wu, B. X., Xiao, J., & Chen, J. M. (2015). Friend recommendation by user similarity graph based on interest in social tagging systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9227, pp. 375–386). Springer Verlag. https://doi.org/10.1007/978-3-319-22053-6_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free