Tags recommending based on social graph

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

Abstract

As fast development of social network, UGC (user generated content) has played a very important role in "Web 2.0". However most of UGC is non-structured data, which is hard to be used by search engine or user recommending system. Social mining is the way to make UGC accessible. But UGC are trivial, noisy, sparse, causing social mining methods inefficient. In this paper, we propose a tag recommending approach based on social graph. Social graphic recommending can reduce mining depending on UGC, thus be able to generate high quality tags. Our most contribution is to combine social graph with LDA algorithm to find users' latent common interest, thus extract tags. We did experiment on real data crawled from Sina Weibo. The evaluation showed that our approach archived much better precision and recall than baseline methods. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Xu, B., & Zhu, H. (2013). Tags recommending based on social graph. In Lecture Notes in Electrical Engineering (Vol. 211 LNEE, pp. 403–411). https://doi.org/10.1007/978-3-642-34522-7_43

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