New Influence Maximization Algorithm Research in Big Graph

Abstract

Influence maximization is a very hot research in social network. However, it is difficult to find a good algorithm to keep balance between the time complexity and computing result' accuracy. In order to solve this problem, in this paper, we propose two new algorithms. Firstly, we present a heuristic algorithm based on the greedy algorithm, which can reduce the time complexity a lot and it will have a good result, too. Then, we present another new algorithm. We use the k-means idea to solve the IM problem. We use the k-means idea to find s seed nodes. At the same time, we prove these two new algorithms.