Maximal Influence Spread for Social Network Based on MapReduce

• 作者: Chen Ye Dong Li Hong Gao Hongzhi Wang Qiqi Shi Xinfei Shi
• 来源期刊: 国际计算机前沿大会会议论文集
• 学科: 社会科学
• 关键词: SOCIAL Network MAP-REDUCE INFLUENCE SPREAD
• 年，卷（期）: 2015,（1）
• 页码范围: 38-39
• 页数: 2页
• 分类号: C5

摘要

Due to its importance, influence spread maximization problem for social network has been solved by a number of algorithms. However, when it comes to the scalabilities, existing algorithms are not efficient enough to cope with real-world social networks, which are often big networks. To handle big social networks, we propose parallelized influence spread algorithms. Using Map-Reduce in Hadoop as the platform, we proposed Parallel DAGIS algorithm, a parallel influence spread maximization algorithm. Considering information loss in Parallel DAGIS algorithm, we also develop a Parallel Sampling algorithm and change DFS to BFS during search process. Considering two or even more hops neighbor nodes, we further improve accuracy of DHH. Experimental results show that efficiency has been improved, when coping with big social network, by using Parallel DAGIS algorithm and Parallel Sampling algorithm. The accuracy of DHH has been improved by taking into account more than two hops neighbors.