Optimizing online social networks for information propagation.

PLoS One

Web Sciences Center, School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China; Department of Physics, University of Fribourg, Fribourg, Switzerland.

Published: October 2015

Online users nowadays are facing serious information overload problem. In recent years, recommender systems have been widely studied to help people find relevant information. Adaptive social recommendation is one of these systems in which the connections in the online social networks are optimized for the information propagation so that users can receive interesting news or stories from their leaders. Validation of such adaptive social recommendation methods in the literature assumes uniform distribution of users' activity frequency. In this paper, our empirical analysis shows that the distribution of online users' activity is actually heterogenous. Accordingly, we propose a more realistic multi-agent model in which users' activity frequency are drawn from a power-law distribution. We find that previous social recommendation methods lead to serious delay of information propagation since many users are connected to inactive leaders. To solve this problem, we design a new similarity measure which takes into account users' activity frequencies. With this similarity measure, the average delay is significantly shortened and the recommendation accuracy is largely improved.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4015991PMC
http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0096614PLOS

Publication Analysis

Top Keywords

users' activity
16
social recommendation
12
online social
8
social networks
8
adaptive social
8
propagation users
8
recommendation methods
8
activity frequency
8
similarity measure
8
social
5

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!