Name
Title | ||
|---|---|---|
Balancing Centrality and Similarity for Efficient Information Recommendation in Social Networks |
Abstract | ||
|---|---|---|
To maximize the scope and effect of information propagation in social networks, we need to explore both its intrinsic properties and spread theories elaborately. The key challenge is how we find the individuals who are the most powerful to maximize the propagation of a specific thing in a given network topology. Due to its high time complexity, the classical solution, i.e., Greedy algorithm, can not be applied to solve this problem, especially for a large-scale social network. In this paper, taking centrality and similarity into account, we define a novel viral marketing model to update the opinions of individuals on specific things or products, and propose an advertisement recommendation scheme to find the optimal individuals for influence maximization based on two epidemiology models, i.e., SIR (Susceptible, Infectious and Removed) and IC (Independent Cascade). Through extensive simulations and analysis, we show that the proposed algorithm can improve the performance of the recommendation system with a low time complexity, and the running time of our proposed algorithm is around 40% lower than that of the benchmark. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/I-SPAN.2018.00014 | 2018 15th International Symposium on Pervasive Systems, Algorithms and Networks (I-SPAN) |
Keywords | DocType | ISBN |
Social networking (online),Integrated circuit modeling,Greedy algorithms,Computational modeling,Network topology,Time complexity | Conference | 978-1-5386-8534-1 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiao Hu | 1 | 0 | 0.34 |
| Xiaoyan Yin | 2 | 77 | 14.85 |
| Yi Meng | 3 | 0 | 0.34 |
| Aiqin Hou | 4 | 11 | 6.66 |
| Tao Zhang | 5 | 220 | 69.03 |
| Baoying Liu | 6 | 0 | 1.35 |