Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Maximal Influence Spread for Social Network Based on MapReduce
verfasst von : Qiqi Shi, Hongzhi Wang, Dong Li, Xinfei Shi, Chen Ye, Hong Gao
Erschienen in: Intelligent Computation in Big Data Era
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.