Abstract

SummaryWith the massive popularity of social networks, more and more users can produce millions of user‐generated contents (UGCs) daily. However, UGC quality is uneven, which has posed challenges to finding superior contents in such a large data set. In this paper, we present a new idea of UGC quality evaluation exploiting user communities, which are formed by users either in a friend circle or with similar interests in social networks. The intuition is that a user community can help evaluate the UGC quality better than a single user. Hence, we propose a new graph‐theoretic user communities and contents co‐ranking (UCCC) algorithm for UGC quality evaluation. UCCC evaluates UGCs and their related user communities simultaneously based on three different relationship networks: the network connecting UGCs, the network connecting user communities, and a third network that ties the two together. Contents and user communities are ranked following a co‐ranking algorithm based on the assumption that there is a mutually reinforcing relationship between them. Experiments using real‐world data have shown that UCCC outperforms competitive algorithms by a good margin in most cases and a user community is more useful than a single user for UGC quality evaluation. Copyright © 2014 John Wiley & Sons, Ltd.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.